Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:03 | history | edited | CommunityBot | Commonmark migration | |
| Apr 4, 2020 at 14:50 | history | edited | the default. | CC BY-SA 4.0 | added 132 characters in body; dot before log looks ugly |
| Apr 1, 2020 at 9:04 | comment | added | the default. | @xnor That would involve implementing a O(n log n) sort or radix sort, which can be more complicated than a O(n*sqrt(n)) algorithm. There's, for example, a gap sequence that results in O(n * sqrt(n)) complexity for Shellsort. | |
| Apr 1, 2020 at 8:55 | comment | added | xnor | I feel like this will be answered by implementing sorting efficiently, then doing something pointless for the required number of steps. | |
| Apr 1, 2020 at 8:36 | history | answered | the default. | CC BY-SA 4.0 |