Problem:
Question 1- With the help of an example prove how a binary search can prove to be more efficient than a sequential search for an array of 10 sorted numbers.
Question 2- Create an array of 100 random numbers between 0-100. Sort the array using bubble sort and insertion sort. Create two counters to keep track of the number of operations taken for each sort algorithm and compare them. Which sort algorithm is more efficient
Step by step instructions so I can understand would be greatly appreciated!