Searching, sorting and algorithm efficiency

Question 1 of 10

Merge sort works by

Question 2 of 10

The sort that splits lists in half and merges them is ___ sort.

Question 3 of 10

The time complexity of a binary search is

Question 4 of 10

Divide and conquer algorithms

Question 5 of 10

Space complexity measures

Question 6 of 10

The time complexity of a linear search in the worst case is

Question 7 of 10

Explain why sorting a list first can be worthwhile if it will be searched many times.

Question 8 of 10

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

Question 9 of 10

An O(1) algorithm takes

Question 10 of 10

Explain Big-O notation and order O(1), O(log n), O(n) and O(n²) from most to least efficient, with an example of each.