The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+3 votes
429 views

The average case occurs in Linear Search Algorithm when

  1. The item to be searched is in some where middle of the Array
  2. The item to be searched is not in the array
  3. The item to be searched is in the last of t he array
  4. The item to be searched is either in the last or not in the array
in Algorithms by Veteran (100k points)
recategorized by | 429 views

1 Answer

+2 votes
Best answer
Ans is A in this option number  of comparisons  will be around n/2  

rest 3 choices are worst case where number  of comparisons  will be exactly n
by Boss (48.4k points)
edited by
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,092 questions
55,276 answers
190,803 comments
86,086 users