The element being searched for is not found in an array of
100 elements. What is the average number of comparisons
needed in a sequential search to determine that the element
is not there, if the elements are completely unordered?
- 11 Answers
- 31741 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / ntrphanikumar
100 comparisions
since element is not there and the data is unordered we need
to compare with each and every element
| Is This Answer Correct ? | 46 Yes | 6 No |
Post New Answer View All Answers
How can we delete the first node from the singly linked list?
What do you mean by general trees?
How to check array contains value or not?
How many types of lists are there?
Which is the best book for data structures and algorithms?
How do you sort an array in decreasing order?
What exactly is data?
Define an algorithm. What are the properties of an algorithm?
Difference between arrays and linked list?
Which file contains the definition of member functions?
Is red black tree balanced?
What is meant by binary tree traversal?
What are priority queues?
Write an algorithm for inserting and deleting an element from doubly linked list?
Is list same as array?
