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
- 31809 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / siya
100 comparisons
| Is This Answer Correct ? | 7 Yes | 3 No |
Post New Answer View All Answers
Why is waste sorting important?
How can you insert a node in a random location of the linked list?
What is the purpose of sorting algorithms?
Define 2-3-4 tree?
What is a concurrenthashmap?
Define distributed query and linked server?
What is data structure explain in detail?
Which of the collections allows null as the key?
What is frozenset?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
What is a simple graph?
Is vector a collection?
Why is selection sort used?
Differentiate between failfast and failsafe.
What is the complexity of adding an element to the heap?
