Hi everyone, I have two more problems which I could really do with some help on if anyone can offer any advice please?
I have been asked to sketch an extractMax algorithm, which, from a d-Heap removes the Maximum and restores the d-Heap structure. I must then analyse the run time dependant on n and d.
My other problem is that I must prove whether the Selection Sort, Bubble Sort, Heapsort, Quicksort, Mergesort and Countingsort are stable or unstable. I have done this for all except the Countingsort. Can anyone advise how I can show this as I dont really understand it.
Any help would be great and very very much appreciated.