Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 16639 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / vivek tiwari
f(n)= 1.Pn + 2.Pn + 3.Pn +...+ N.Pn
where
Pn = 1/N
f(n)= 1.1/N +2.1/N + 3.1/N+....+N.1/N
= (1+2+3+....+N)1/N
= N(N+1)/2N
= (N+1)/2
| Is This Answer Correct ? | 47 Yes | 1 No |
Answer / bipin from utkal university mc
suppose there are five element 23,56,78,12,90
minimum time require means searching element present at
first so it takes only one comparison
maximum time require means searching element present at
last so it takes n No. of comparison(here 5 )
so avarage comarison=(1+n)/2
| Is This Answer Correct ? | 10 Yes | 1 No |
Answer / kalyani
Searching an element in an array, the search starts from the first element till the last element the average number of comparisons in a sequential search is (N+1)/2,where N is the size. The number of comparisons will be 1, if element is in the first position and if element is in the last position the number of comparisons will be N.
| Is This Answer Correct ? | 0 Yes | 0 No |
List the limitations of linear probing?
What are the drawbacks of array implementation of queue?
What is time complexity of sorting algorithms?
What is rule regarding overriding equals and hascode method?
What is the use of space complexity and time complexity?
Does hashset allow duplicates?
Name a few tree data structure application.
List all data structures you would use for a memory management module.
0 Answers HPCL, Hughes Systique Corporation, ITC Indian Tobacco Company,
Can you store different types in an array?
Explain circular linked list?
What is the need for extendible hashing?
How do you find the space complexity of a bubble sort?
Windows 
