Unformatted text preview: and code listing, and an electronic copy of your code. 2. What is the BigO complexity of: a. Heapify function b. Build_Heap function c. Heap_Sort Show all the steps in the computation of the BigO 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
 MarkDrela
 Recursion, Big O notation, bigO complexity

Click to edit the document details