In the worst case, a linear search locates a value in an array of length n in ____ steps. A)O(log n²) B)O(n) C)O(log n) D)O(n²)

Name: In the worst case, a linear search locates a value in an array of length n in ____ steps. A)O(log n 2 ) B)O(n) C)O(log n) D)O(n 2 )
Brand: Quizplus
Rating: 4.9 (29 reviews)

Question

Quizplus · Accepted Answer

In the worst case, the linear search needs to examine each element in the array one by one, which takes a time proportional to n, so the time complexity of linear search is O(n).

In the Worst Case, a Linear Search Locates a Value