Question: Trace the execution of quicksort on the following array, assuming that the first item in each subarray is the pivot value. Show the values of first and last for each recursive call and the array elements after returning from each call. Also, show the value of pivot during each call and the value returned through pivIndex. How many times is sort called, and how many times is partition called?
55 50 10 40 80 90 60 100 70 80 20 50 22
Question: When does quicksort work best, and when does it work worst?
Question: What is the purpose of the pivot value in quicksort? How did we first select it in the text, and what is wrong with that approach for choosing a pivot value?
Question: For the following array
30 40 20 15 60 80 75 4 20
show the new array after each pass of insertion sort and selection sort. How many comparisons and exchanges are performed by each?
Question: For each tree shown below, answer these questions. What is its height? Is it a full tree? Is it a complete tree? Is it a binary search tree? If not, make it a binary search tree. see image.
Question: Show the breadth first search trees for the following graphs. see image.