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
- 35543 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / pavan
100
| Is This Answer Correct ? | 19 Yes | 4 No |
Post New Answer View All Answers
What is arraylist load factor?
What are the properties of binary heap?
What is stable sorting method?
What is the difference between a push and a pop?
Write an algorithm that counts number of nodes in the circular linked list
Name two algorithms two find minimum spanning tree?
State the merits of linear representation of binary trees?
Can you please explain the difference between array_name and &array_name?
Is hashmap get thread safe?
Is boolean a data type?
What exactly is data?
Is arraylist faster than array?
Which is better stack or queue?
How do you check if a stack is empty or not?
Does treeset remove duplicates?
