Search application

Question 1

What should a linear search return if the item is found?

Answer 1

• The index of the target

Question 2

What should a linear search return if the item is not found?

Answer 2

• -1
• Or another clear ‘not found’ output

Question 3

What important index rule should you remember in search questions?

Answer 3

• Lists and arrays are usually 0-indexed

Question 4

In a linear search, when should the algorithm stop?

Answer 4

• As soon as the item is found
• Or when the end of the list is reached

Question 5

Which search is better for a small or unsorted list?

Answer 5

• Linear search

Question 6

Which search is better for a large sorted list?

Answer 6

• Binary search

Question 7

What should you do in a binary search on an even-length list?

Answer 7

• Choose middle-left or middle-right
• Then stay consistent

Question 8

What happens in binary search if the target is smaller than the middle value?

Answer 8

• Search the left half

Question 9

What happens in binary search if the target is greater than the middle value?

Answer 9

• Search the right half

Question 10

When does binary search stop?

Answer 10

• When the target is found
• Or when the search range cannot be split further