Group 3

Which algorithm divides the list into two parts: sorted and unsorted ?

• Bubble Sort

• Selection Sort

• Insertion Sort

• • Quick Sort

In the Binary Search algorithm, which element is checked first ?

• The first element

• The last element

• The middle element

• The smallest element

In the Selection Sort algorithm, which element is selected for swapping?

• The largest element

• The smallest element

• The middle element

• The last element

Which of the following algorithms requires the list to be sorted before execution ?

• Sequential Search

• Binary Search

• Bubble Sort

• Selection Sort

Which algorithm can stop early if no swaps occur in a pass ?

• Bubble Sort

• Selection Sort

• Insertion Sort

• Quick Sort