1

1.  What is the time complexity of 'Build Heap' operation? Build Heap is used in building a max(or min) binary heap from a given array. “Build Heap” is used in Heap Sort as a first step for sorting. (25 Points)

2. Build the Initial heap from the following array. Each element remains in its place after the build. (35 Points)

         32, 8, 20, 5, 15, 14, 29, 9, 11, 1, 4

3a. Describe an 'array' data type. (what does the array data type mean.) 

3b. Describe (with example)  how to create an array in C/C++   

3c. Describe (with example)  how to create an array  in Python.    

3d. Describe (with example)  how to create an array in Java.  

4.What is heap sort? What are the pros and cons in using this sorting method. State some uses.