Linear Search Algorithm in DSA Go - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the main idea behind the Linear Search Algorithm?

Linear Search checks each item in a list one by one until it finds the target or reaches the end.

beginner

What is the time complexity of Linear Search in the worst case?

The worst-case time complexity is O(n), where n is the number of items in the list.

intermediate

In which scenario is Linear Search preferred over other search algorithms?

When the list is small or unsorted, Linear Search is simple and effective.

beginner

What happens if the target element is not found in Linear Search?

The algorithm checks all items and returns a special value (like -1) to show the target is missing.

intermediate

How does Linear Search differ from Binary Search?

Linear Search checks items one by one without needing order; Binary Search requires a sorted list and divides the search space.

What does Linear Search do when it finds the target element?

A Sorts the list

B Stops and returns the position of the element

C Continues searching the rest of the list

D Deletes the element

Linear Search stops immediately when it finds the target and returns its position.

What is the best case time complexity of Linear Search?

A O(1)

B O(n)

C O(log n)

D O(n log n)

If the target is the first element, Linear Search finds it immediately in constant time O(1).

Which of these lists is Linear Search most suitable for?

A Large sorted list

B Sorted list with random access

C Large sorted list with frequent searches

D Small unsorted list

Linear Search works well on small unsorted lists because it is simple and fast enough.

If the target is not in the list, what does Linear Search return?

A 0

B The last index

C -1 or a special value indicating not found

D The first index

Linear Search returns -1 or another special value to show the target is missing.

Which of these is NOT true about Linear Search?

A It requires the list to be sorted

B It checks elements one by one

C It can be used on any list

D It has a worst-case time complexity of O(n)

Linear Search does NOT require the list to be sorted; it works on any list.

Explain how Linear Search works step-by-step on a list of numbers.

Think about checking items one by one like looking for a name in a phone book without order.

Describe when and why you would use Linear Search instead of other search methods.

Consider situations where sorting or complex algorithms are too much work.