Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 17063 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Explain linear linked implementation of Stack and Queue?
What are the difference between arraylist and linkedlist from the perspective of sorting?
Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78
Explain binary tree traversals?
Define terminal nodes in a tree?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
List the data structures which are used in hierarchical data model.
Can you use Bubble Sort To sort the number of elements.
When would you use a tuple?
Who invented data structure?
Explain recursive function & what is the data structures used to perform recursion?
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
Which language is best to learn data structures?
Why hashmap is faster than hashset?
Does mentioning the array name gives the base address in all the contexts?
