Answer the following questions and also justify your answers with appropriate examples
Question 1: How many passes through the data will be made by the selection sort for N data items?
Question 2: How many numbers are placed in order on each pass through the data (each iteration of the inner loop) for the selection sort?
Question 3: If an array is sorted in ___ order, the values are stored from highest to lowest.
Question 4: The maximum number of comparisons that a binary search function will make when searching for a value in a 2,000-element array is:
Question 5: A binary search will find the value it is looking for with just one comparison if that value is stored in the ______ array element.
Explain about selection sort and show the step by step solution of selection sort problem.