Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 35472 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 ? | 50 Yes | 7 No |
Post New Answer View All Answers
Write an algorithm to check if there is a loop in a doubly linked list.
What are the advantages of binary search over linear search?
What is the use of bubble sort?
Why is it important to sort waste?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
What is the use of sorting the data?
How are elements stored in hashset?
Define an algorithm.
What is the non linear data structure?
Why sorting is done?
What is a hash index?
Can we give size to arraylist?
What is impact of signed numbers on the memory?
What is ds tree?
What are red-black trees?
