Timeline for Why don't we use quick sort on a linked list?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2018 at 19:43 | comment | added | Mariusz | In partition Sort choosing pivot is limited to the first or last element (last if we keep pointer to the tail node) otherwise choosing pivot is slow Hoare partition is possible only for doubly linked lists Swapping should be replaced with inserting and deleting Tree sort with unbalanced tree has the same compexity as quicksort if we ignore constant factor but it is easier to avoid worst case in tree sort For merge sort there is to few characters in the comment | |
| May 18, 2018 at 17:28 | comment | added | David Richerby | Thanks for your detailed contribution but this isn't a coding site. 200 lines of code doesn't do anything to explain why merge sort is preferred over quick sort for linked lists. | |
| May 18, 2018 at 10:20 | history | edited | Mariusz | CC BY-SA 4.0 | added 3542 characters in body |
| May 18, 2018 at 10:06 | review | Late answers | |||
| May 18, 2018 at 17:28 | |||||
| May 18, 2018 at 9:50 | history | edited | Mariusz | CC BY-SA 4.0 | edited body |
| May 18, 2018 at 9:47 | review | First posts | |||
| May 18, 2018 at 18:00 | |||||
| May 18, 2018 at 9:44 | history | answered | Mariusz | CC BY-SA 4.0 |