Search Algorithms Flashcard

Front

What is a linear search?

Back

A method that checks every element in order

Front

Which search is faster for large, sorted datasets?

Back

Binary Search

Front

What is required for a binary search to work?

Back

Data sorted in order

Front

How does a binary search find an item?

Back

By dividing the list into two parts repeatedly

Front

When is a linear search most useful?

Back

When the dataset is small and unsorted

Front

What is the time complexity of a binary search?

Back

O(log n)

Front

Which search algorithm is simpler to implement? Options: Linear Search, Binary Search, Both are equally complex, None of the above

Back

Linear Search

Front

What happens if you use binary search on unsorted data?

Back

It may not find the correct answer

Front

Why is binary search faster than linear search?

Back

It eliminates half the data with each step.

Front

What is an algorithm?

Back

A structured sequence of steps to solve a problem.