Question
1. Given the following list: 8 6 1 5 4 9 3 7 trace the execution for merge sort. 2.Given the resulting sorted list, trace
1. Given the following list:
8 6 1 5 4 9 3 7
trace the execution for merge sort.
2.Given the resulting sorted list, trace the execution for a binary search, searching for the number 102.
4 9 12 23 45 67 89 92 102 123
Note: Please see the algorithm of binary search in the text, ppt or in the example questions.
3.Given the following list:
8 6 1 5 4 9 3 7
Write out the state of the list while being sorted using the selection sort algorithm.
4.Given the following list:
8 6 1 5 4 9 3 7
Write out the state of the list while being sorted using the insertion sort algorithm:
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started