Searching, Sorting, and Algorithm Efficiency

1. Briefly describe how the binary search algorithm works. Compare it to the operation of the linear search algorithm. Give one advantage and one disadvantage of the binary search algorithm relative to the linear search algorithm.

2. Given the list declaration vals = [16, 3, 8, 9, 2, 15, 6]. Draw or otherwise indicate the contents of the list after the second comparison using the selection sort to sort the list in descending order. Do the same for the insertion sort after three items have been placed in their final positions.