Data Structure › Time Complexity › Question #15245
MCQ Single Best Answer Easy

QWhat is the time complexity of a linear search algorithm for an unsorted array of n elements in the worst case?

ID: #15245 Time Complexity 160 views
Question Info
#15245Q ID
EasyDifficulty
Time ComplexityTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(1) ✔ ✖
  • B O(log n) ✔ ✖
  • C O(n) ✔ ✖
  • D O(n^2) ✔ ✖
Correct Answer: Option C

Explanation

In a linear search algorithm, each element of the array is checked one by one until the target element is found or the end of the array is reached. In the worst case, where the target element is at the last position or absent from the array, the algorithm will need to examine all n elements. Therefore, the time complexity of a linear search is linear, denoted as O(n).

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the time complexity of a depth-first search (DFS) algorithm on a directed acyclic graph (DAG) with V v What is the time complexity of a merge sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a delete operation in a binary heap in the worst case? What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a bubble sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a binary search algorithm for finding an element in a sorted array of n element What is the time complexity of a depth-first search (DFS) algorithm on a graph with V vertices and E edges? What is the time complexity of a quicksort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a topological sort algorithm on a directed acyclic graph (DAG) with V vertices