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
- 35081 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 is the difference between arraylist and array?
Are duplicates allowed in list?
Which is faster quick sort or merge sort?
Write a Program for Linked list manipulation.
How does hashset maintain order?
Are data structures important?
Define a path in a tree?
Explain the common uses of tree database.
What are the different types of data structures?
How do you find the second largest element in an array of integers?
What's difference between stack and queue?
What are the disadvantages of linear list?
What is array and its types in data structure?
How to get top two numbers from an array?
Is heap sort adaptive?
