Register

UGC NET CSE | Junet 2015 | Part 2 | Question: 24

• recategorized by
1,428 views
3 votes
3 votes

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
• recategorized by
User Avatar

1 Answer

Best answer
2 votes
2 votes
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
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
4 answers
1
go_editor asked Jul 31, 2016
4,055 views
UGC NET CSE | Junet 2015 | Part 2 | Question: 48
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time? Selection sort Bubble sort Radix sort Insertion sort
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time?Selection sortBubble sortRadix sortInsertion so...
User Avatar
2 votes
2 votes
1 answer
2
go_editor asked Jul 30, 2016
6,038 views
UGC NET CSE | Junet 2015 | Part 2 | Question: 25
To determine the efficiency of an algorithm the time factor is measured by Counting micro seconds Counting number of key operations Counting number of statements Counting kilobytes of algorithm
To determine the efficiency of an algorithm the time factor is measured byCounting micro secondsCounting number of key operationsCounting number of statementsCounting kil...
User Avatar
Link Copied!