Get Started
1278

Q: The complexity of linear search algorithm is

  • 1
    O(n2)
  • 2
    O(n log n)
  • 3
    O(n)
  • 4
    O(log n)
  • उत्तर देखें
  • Workspace

Answer : 3. "O(n)"
Explanation :

Answer: C) O(n) Explanation: The worst case complexity of linear search is O(n).

Previous Next
Verbal Reasoning Bank Exams GATE IIT JEE

सबसे विस्तृत एग्जाम तैयारी प्लेटफार्म

Examsbook Prep ऐप आज ही प्राप्त करें