Which of these are search algorithms?

Which of these algorithms compares consecutive pairs of items and swaps two items if they're not in order?

Which of these algorithms requires that the items it's given are in order?

Which of these algorithms sorts items by first splitting the list of items down into smaller and smaller groups?

Which of these algorithms searches for something by first looking in the middle of a list?

Which of these algorithms is usually more efficient (takes fewer steps) in sorting a list of items?

What algorithm does this image represent?

Which of these algorithms eliminates half of its possibilities each time it makes a check?

Which algorithm does this image represent?

Which algorithm does this image represent?

Advantages of a linear search algorithm include...