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
- 35548 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
What are threaded binary trees?
Tell us the difference between merge and quick sort. Which one would you prefer and why?
What thread means?
Differentiate file structure from storage structure?
What are examples of data structures?
Which sorting algorithm is best for large data?
Tell me can the size of operator be used to tell the size of an array passed to a function?
State the difference between stacks and linked lists?
What is quick sort example?
Define articulation point?
Can we sort hashmap?
Why would you use a linked list?
Define the queue data structure.
What is a minimum spanning tree?
Is quicksort greedy algorithm?
