Timeline for Checking if there are 2 elements in an array that sum to X in O(n lg n)
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2018 at 8:52 | comment | added | gnasher729 | If an algorithm needs to work for sorted arrays as well, and is required to run in O (n log n), then you can always sort the array first. | |
| Feb 28, 2014 at 13:09 | vote | accept | HaloKiller | ||
| Feb 28, 2014 at 13:10 | |||||
| Feb 28, 2014 at 13:09 | vote | accept | HaloKiller | ||
| Feb 28, 2014 at 13:09 | |||||
| Feb 21, 2014 at 3:29 | comment | added | Yuval Filmus | By the way, this is indeed one way to get $O(n\log n)$. (Though that doesn't answer the question.) | |
| Feb 20, 2014 at 22:51 | review | Low quality posts | |||
| Feb 22, 2014 at 8:47 | |||||
| Feb 20, 2014 at 22:35 | history | answered | Yuval Filmus | CC BY-SA 3.0 |