Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 17050 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Define linked lists?
What is the difference between adt and data structure?
Can arraylist store primitives?
Define articulation point?
write a program to accept name & sort them?
What is difference between set and map?
Why is sorting and classifying important?
In an avl tree, at explain what condition the balancing is to be done?
What is weight balanced tree in data structure?
What is raid (redundant array of inexpensive disks)?
Which sorting method is slowest?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
What do you mean by structure property in a heap?
Can we add duplicate keys in a hashmap?
Will arraylist maintain insertion order?
