Unit 6 : Algorithms and Recursion Test Review

Front

What does Binary Search do if a list has one element?

Back

Checks if the element matches and returns its index.

Front

Is Linear Search faster on a sorted array?

Back

No, because it still checks every element.

Front

True or False: Linear Search is more efficient than Binary Search on a sorted array.

Back

False.

Front

What must be true before performing a binary search?

Back

The elements must be sorted.

Front

How does a binary search work?

Back

Binary searches start in the middle and eliminate half of the list in each iteration until the desired value is found.

Front

What is the time complexity of Binary Search?

Back

O(log n).

Front

What is the time complexity of Linear Search?

Back

O(n).

Front

What is a key advantage of Binary Search over Linear Search?

Back

Binary Search is more efficient for large, sorted datasets.

Front

What type of data structure is required for Binary Search?

Back

A sorted array or list.

Front

What happens if you perform Binary Search on an unsorted list?

Back

It may return incorrect results.