Searching Algorithms

Where is linear searching used?

• When the list has only a few elements

• When performing a single search in an unordered list

• Used all the time

• When the list has only a few elements and when performing a single search in an unordered list

What is the best case complexity for linear search?

• O(nlogn)

• O(logn)

• O(n)

• O(1)

What is the worst case complexity for linear search?

• O(nlogn)

• O(logn)

• O(n)

• O(1)

Which of the following is a disadvantage of linear search?

• Requires more space

• Greater time complexities compared to other searching algorithms

• Not easy to understand

• Not easy to implement

Which of the following is not an application of binary search?

• To find the lower/upper bound in an ordered sequence

• Searching for a word in a dictionary

• Debugging

• To search in unordered list

Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are doneuntil the element is found using binary search?

• 1

• 2

• 3

• 4

Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations using binary search?

• 90 and 99

• 90 and 100

• 89 and 94

• 94 and 99

What is the time complexity of binary search with iteration?

• O(nlogn)

• O(logn)

• O(n)

• O(n2)

Jump search is worse than linear search in terms of time complexity.

• True

• False

Jump search has a worst case time complexity of O(n).

• True

• False