10) An advantage that Linear search has over Binary search is

Its worst-case scenario time complexity is faster that Binary searches worst case scenario

It does not require a sorted array

It has a better time complexity

Its best-case scenario time complexity is faster than binary searches best case scenario

11) Assume you have a set of pre-sorted arrays of increasing size. Which of the following sorting algorithms would you expect to display the best Big O time complexity?

Selection sort

Merge sort

Bubble sort

12) The time complexity of Linear Search is:

O(n^2)

O(log(n))

O(n Log(n))

O(n)

13) An advantage insertion sort has over merge sort is:

Better average time complexity

Better best-case complexity

Better worst-case complexity