Name the search or sort algorithm that:

• Makes several passes through the array, selecting the next smallest item in the array each time and placing it where it belongs in the array.
• At each stage, compares the sought key value with the key value of the middle element of the array.