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
- 31709 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / mounesh badiger
we have to check all the elements of the array.so average is
n(size of array)
| Is This Answer Correct ? | 14 Yes | 3 No |
Post New Answer View All Answers
What are the applications of linked list?
Is json a data structure?
Who invented merge sort?
Define the tree data structure.
What is a hash in programming?
What is the basic of data structure?
What is linked list with example?
What are three common types of traversals?
Can we add elements to final list?
Is there any difference between int[] a and int a[]?
Does hashmap allow null keys?
What is a threaded binary tree? Explain its operation with example?
What is heap tree?
What is meant by linked list?
Mention a few applications of linked lists?
