Unformatted text preview: and code listing, and an electronic copy of your code. 2. What is the Big-O complexity of: a. Heapify function b. Build_Heap function c. Heap_Sort Show all the steps in the computation of the Big-O complexity. Note: the code for heap_sort, build_heap and heapify was shown in lecture C11 and has been distributed via email....
View Full Document
- Fall '05
- Recursion, Big O notation, big-O complexity