One question asks for the “highest” best case scenario for sorting: quicksort, selection sort merge sort, and bubble sort. It says the right answer is quick sort, and correctly identifies quicksort as having a best case of O(nlogn)… which is far worse than O(n) for bubble sort. But if they meant higher as in worse, then it’s still wrong as selection sort has a best case of O(n^2), which is far worse.