Timeline for Is it possible to sort this type of array in O(n) time?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 30 at 13:35 | comment | added | Lisa E. | I agree. I have edited my answer now. | |
| May 30 at 13:35 | history | edited | Lisa E. | CC BY-SA 4.0 |
Making "unlikely to exist" into " do not exist" per @Oscar Smith's comment
|
| May 30 at 13:30 | comment | added | Oscar Smith | If you are only considering comparison sorts, your "unlikely" can be turned into an impossible. The nlog(n) bound on sorting is known to b etight. | |
| May 30 at 10:44 | vote | accept | Itamar Adar | ||
| May 30 at 6:12 | history | edited | Lisa E. | CC BY-SA 4.0 |
Adding details about excluding non-comparison sorts.
|
| S May 30 at 6:07 | review | First answers | |||
| May 30 at 14:18 | |||||
| S May 30 at 6:07 | history | answered | Lisa E. | CC BY-SA 4.0 |