2.1 Algorithms - Searches and Sorts

Which search algorithm requires the items to be sorted?

• Linear

• Binary

Which search algorithm separates the list into a sorted and an unsorted sublist?

• Bubble

• Binary

• Insertion

• Merge

Which search algorithm does not need the items to be sorted first?

• Binary

• Linear

Which search algorithm checks the items and compares them to the item we are looking for one by one?

• Linear

• Binary

Which algorithm compares the items in pairs all the way through the list until one item finishes in the correct position toward the end of the list?

• Binary

• Bubble

• Merge

• Insertion

Which sorting algorithm divides the original list into small sublists and then sorts them by combining them back together in order?

• Merge

• Insertion

• Binary

• Bubble

Which one of these is not a sorting algorithm?

• Binary

• Bubble

• Merge

• Insertion

Which search algorithm sets a pointer in the middle and then checks whether the item is higher or lower?

• Binary

• Merge

• Bubble

• Insertion

Which of these two algorithms is faster in general?

• Bubble

• Insertion

Which of these sorts is fasters with lists that are shorter and almost already sorted?

• Binary

• Insertion

• Merge

• Bubble