What is the average number of comparisons in a sequential
search?
- 5 Answers
- 14718 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
What is the space complexity of bubble sort?
What member function places a new node at the end of the linked list?
What type of algorithm is binary search?
What do u mean by array?
What are the advantages and disadvantages of copyonwritearraylist?
What happens if we try to insert duplicate key in hashmap?
Explain binary tree traversals?
What are the advantages of sorting and filtering data?
Which collection type is used to maintain uniqueness of data structure?
What is the difference between hashmap and arraylist?
What are the types of array operations?
What is storage structure in data structure?
How do you sort elements in an arraylist?
Which is faster hashmap or concurrenthashmap?
What are hashmaps good for?
