Searching, sorting and algorithm efficiency

Question 1 of 10

Show the stages of merge sort on [38, 27, 43, 3, 9, 82, 10].

Question 2 of 10

O(n²) algorithms grow more slowly than O(n) algorithms.

Question 3 of 10

Merge sort uses a divide-and-conquer approach.

Question 4 of 10

Big-O notation describes

Question 5 of 10

Which algorithm is best for searching an unsorted list that will be searched only once?

Question 6 of 10

Merge sort has a time complexity of

Question 7 of 10

The item chosen in quick sort to divide the list is the ___.

Question 8 of 10

Binary search requires the data to be sorted.

Question 9 of 10

The Big-O complexity of bubble sort in the worst case is O(___).

Question 10 of 10

Quick sort chooses a