Timeline for Algorithm to sort array into K increasing subsets?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 13, 2024 at 9:38 | answer | added | codeR | timeline score: 1 | |
| Jun 12, 2024 at 13:09 | comment | added | gnasher729 | Look careful at your goal. If k >= sqrt n, then n log k = \Theta(n log n). You only care about the log k instead of log n if k is small. Quicksort + not sorting partitions that need not be sorted will be O (n log k). | |
| S Jun 12, 2024 at 11:44 | review | First questions | |||
| Jun 22, 2024 at 5:08 | |||||
| S Jun 12, 2024 at 11:44 | history | asked | user166586 | CC BY-SA 4.0 |