Searching Algorithms - Study Mode

Show All Answers

[#86] What is the time complexity of exponential search for a large dataset?

(A) O(log n)

(B) O(√n)

(C) O(n)

(D) O(n log n)

Correct Answer

(A) O(log n)

[#87] Which searching algorithm is best suited for finding an item in an array with a uniform distribution of values?

(A) Jump Search

(B) Binary Search

(C) Linear Search

(D) Interpolation Search

Correct Answer

(D) Interpolation Search

[#88] What is the worst case runtime of linear search(recursive) algorithm?

(A) O(n)

(B) O(logn)

(C) O(n 2 )

(D) O(nx)

Correct Answer

(A) O(n)

[#89] What is the length of the step in jump search?

(A) n

(B) n/2

(C) sqrt(n)

(D) 1

Correct Answer

(C) sqrt(n)

[#90] What is the time complexity of exponential search when the input array is sorted but the values are not uniformly distributed?

(A) O(n 1/2 )

(B) O(log log n)

(C) O(n)

(D) O(log n)

Correct Answer

(C) O(n)