Why do we analyze the average-case performance of a randomized algorithm and not its worst-case performance?
Answer to relevant QuestionsShow that quick sort's best-case running time is Ω (n lg n).Use induction to prove that radix sort works. Where does your proof need the assumption that the intermediate sort is stable?Let X [1 .. n] and Y [1 .. n] be two arrays, each containing n numbers already in sorted order. Give an O (lg n)-time algorithm to find the median of all 2n elements in arrays X and Y.Show that if a node in a binary search tree has two children, then its successor has no left child and its predecessor has no right child.Suggest how to implement RB-INSERT efficiently if the representation for red-black trees includes no storage for parent pointers.
Post your question