You are responsible for the appropriate level of detail. Step by step solution (scanned from paper or word doc drawing or any tools of that kind) is required. NO DIRECT answers.
- Compare the efficiency of using sequential search on an ordered table of size n and an unordered table of the same size for the key key:
- If no record with the key key is present
- If one record with the key key is present and only one is sought.
- If more than one record with the key key is present and it is desired to find only the first
- If more than one record with the key key is present and it is desired to find them all.
- Show the progress of each pass of the selection sort for the following array. How many passes are needed? How many comparisons are performed? How many exchanges? Show the array after each pass. 40 35 80 75 60 90 70 75 50 22
- Trace the execution of the merge sort on the following array, providing a figure like the one on the lecture slide.
55, 50, 10, 40, 80, 90, 60, 100, 70, 80, 20, 50, 22
- Build the heap from the numbers in the following list. How many exchanges were required? How many comparisons? 55 50 10 40 80 90 60 100 70 80 20 50 22
=================================================================
