1) Describe a case where quicksort will result in quadratic behavior.
2) Give a concise accurate description of a good way for quicksort to improve its performance by using insertion sort.
3) Write two or three clear sentences to describe how a heap sort works.
4) Explain (in English) the algorithm for insertion sort.
5)1) Two of your co-workers (Sam and Kris) both wrote a different unique sorting algorithm. Initial tests (with 50 data elements) show that Kris' program ran approximately 5x faster (Sam's took 5x as long to complete). As the chief engineer, you need to figure out which one to use - Should Sam's program be dropped in favor of Kris'? Is Kris' better? Why or why not? What other tests would you run (what other criteria would you be looking for)? Make sure you explain your answer.