Sequential Search is in the complexity class
A) O(1)
B) O(log n.
C) O(n.
D) O(n log n.

Question

Quizplus · Accepted Answer

Sequential Search has a time complexity of O(n), as it takes linear time to search through the elements of an unsorted array. Therefore, the best choice is C. O(1) is constant time and not applicable to Sequential Search, while O(log n) and O(n log n) are more suitable for searching algorithms that divide the search area, such as Binary Search or Merge Sort.

Sequential Search Is in the Complexity Class