c - Heap sort using linked lists -
i wondering if has ever used linked lists heap sort , if have provide code. have been able heapsort using arrays, trying in linked lists seems unpractical , pain in know where. have implement linked lists project im doing, appreciated.
also using c.
the answer "you don't want implement heap sort on linked list."
heapsort sorting algorithm because it's o(n log n) , it's in-place. however, when have linked list heapsort no longer o(n log n) because relies on random access array, not have in linked list. either lose in-place attribute (but needing define tree-like structure o(n) space). or need without them, remember linked list o(n) member lookup. brings runtime complexity o(n^2 log n) worse bubblesort.
just use mergesort instead. have o(n) memory overhead requirement.
Comments
Post a Comment