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
- 31772 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
Is treemap sorted?
What is meant by deque?
What is the logic to reverse the array?
How does quicksort partition work?
How to sort an Array?
Mention the advantages of representing stacks using linked lists than arrays?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
What is dequeue in data structure?
How many sorting techniques are there?
What is linked list ?
Write a code for dynamic allocation of array.
What is lifo?
What is the use of space complexity and time complexity?
Why insertion is faster in linked list?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
