Timeline for Traversal Heap Sort (No Extractions)
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27 at 21:35 | vote | accept | ariko stephen | ||
| Dec 29, 2024 at 9:17 | comment | added | greybeard | (Those graphs differ somewhat from the ones I got (/get after trying "deoptimisation"). They agree on heap_sort_custom & heapsort, but (deoptimised)nsmallest and sorted almost coincide here(3.12). I let it run up to 8M entries; past L3 size heapsort & sort_using_heap converge. The gap between heap_sort_custom and sorted seems to shrink from about 130:1 to 100:1.) | |
| Dec 29, 2024 at 0:31 | history | edited | J_H | CC BY-SA 4.0 |
add sorted() to the timing plot
|
| Dec 28, 2024 at 7:19 | comment | added | ariko stephen | I agree it definitely doesn't make sense to prefer untested code like this to using the built in sorted function that's well tested for correctness and optimized for performance. My motivation for posting here is first it's a new approach, I haven't seen any algorithm that simply traverses a heap to obtain a sorted list. And two given the community here, it's possible a good usecase can be found . | |
| Dec 28, 2024 at 3:42 | history | edited | J_H | CC BY-SA 4.0 |
added 233 characters in body
|
| Dec 28, 2024 at 3:30 | history | edited | J_H | CC BY-SA 4.0 |
amend for Greybeard
|
| Dec 28, 2024 at 2:12 | history | edited | J_H | CC BY-SA 4.0 |
added 276 characters in body
|
| Dec 28, 2024 at 2:05 | history | answered | J_H | CC BY-SA 4.0 |