4.2.3 Discuss an algorithm to solve a specific problem

A binary search is faster, but can only be performed in a sorted list
A sequential search is slower but can be performed whether the list is sorted or not
A bubble sort can "quit early" if no swaps are made in a pass. But it makes lots of swaps.
A selection sort must always perform a certain numer of passes - it cannot "quit early". But it makes fewer swaps generally
Both bubble and selection sort are equally complex

You can use this website to better compare the speeds of each selection procedure in different types of situations.

https://www.toptal.com/developers/sorting-algorithms/