Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 16894 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 |
Can we create a null as a key for a map collection?
Write the programs for Linked List (Insertion and Deletion) operations
9 Answers College School Exams Tests, Persistent, TCS,
List the area of applications where stack data structure can be used?
List out the disadvantages of using a linked list?
What is raid (redundant array of inexpensive disks)?
Define an algorithm. What are the properties of an algorithm?
Discuss the difference between a stack and an Array?
What is the best sorting technique?
What is stable sort example?
Which sort show the best average behavior?
Define linked list data structure.
Parenthesis is never required in postfix or prefix expressions, why?
Windows 
