Show how the binary search algorithm discussed searches for 25 in the sorted list below: 4 6 17 25 32 39 41 43 45 49

Answer the following question for basic sorting algorithms. Here is an array of 7 integers: (1)                     8   3   2   0   1   9   7   Draw this array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest, and always pick the smallest element in each iteration).           Here is an array of 7 integers: (1)                     8   3   2   0   1   9   7   Draw this array after the FIRST iteration of the large loop in a bubble sort (sorting from smallest to largest).

write an algorithm to find a mode of a sorted list using only methods of the ADT sorted list

Apply the merge sort on the following list and sort the list in decreasing order: 91 98 29 93 98 53 68 33 33 47 You must show how the list is divided by the recursive calls to MERGE-SORT, then merged at each stage to obtain the final sorted list.