Anonymous user
Sorting algorithms/Tree sort on a linked list: Difference between revisions
Sorting algorithms/Tree sort on a linked list (view source)
Revision as of 07:57, 30 March 2014
, 10 years ago{{draft task|Sorting Algorithms}}
(The tree sort is considered by some to be the faster method to sort a linked list, followed by Quicksort and Mergesort:) |
m ({{draft task|Sorting Algorithms}}) |
||
Line 1:
{{draft task|Sorting Algorithms}}
{{Sorting Algorithm}}
{{Wikipedia pre 15 June 2009|pagename=article|lang=en|oldid=295989333|timedate=15:13, 12 June 2009}}
Line 8:
[[Sorting_algorithms#Sediment sort|Sediment sort]], [[Sorting_algorithms#bubble sort|bubble sort]], [[Sorting_algorithms#selection sort|selection sort]] perform very badly.
'''Test case:''' Create a linked list of all the sentences of all the episodes of [http://www.telelib.com/authors/J/JoyceJames/prose/finneganswake Finnegans Wake by James Joyce]. Load them into a local memory based linked list, then tree sort them inplace and print the number of node swaps and Bogomips required to perform the sort. (The book is to be stored locally in a test file on disk for use by the specimin code.)
| |||