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
- 35489 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
Why do we need sorting algorithms?
What are the tasks performed during postorder traversal?
Differentiate between hashmap and hashtable.
What is the meaning of anonymous array? Explain with an example?
Why do we use collections?
What is sorted map?
How is a hashset implemented?
How do I start preparing for placement?
Which sorting algorithm is best for small data?
Which collection is used for sort?
What is default array size?
What is binary tree used for?
what is Linked lists?
What are the non linear data structure?
How do I use quick sort?
