Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 17076 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
Differentiate between singly and doubly linked lists?
Define a priority queue?
How do you find the size of an arraylist?
What is a reverse linked list.
What is the difference between data types and data structures?
What is the difference between arrays sort and collections sort?
How can we delete the first node from the singly linked list?
What do you mean by quadratic probing?
How do you access the values within an array?
What is difference between capacity and size of arraylist?
Why hashtable is faster than arraylist?
Is char array null terminated?
Why do we use binary search?
What is the difference between Array and Arraylist?
How to show internal storage representation of data structure in RDBM?
