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
- 31810 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / pavan
100
| Is This Answer Correct ? | 18 Yes | 4 No |
Post New Answer View All Answers
What is the use of sorting?
Given an array of integers, devise a program to replace every element with the next greatest element on the right side in the array. Also, replace the last element with 5 as there no element on the right side of it.
What are the 3 control structures in programming?
What actions are performed when a function is called?
What is the use of substring?
How many pointers are necessary to implement a simple linked list?
What is the most used data structure?
Run time memory allocation is known as ?
Which list does not allow duplicates?
What are the different data structures?
Which sorting algorithm is considered the fastest?
Differentiate between iterable and iterator.
How do you get placements?
Which is better selection or bubble sort?
Does treemap sort on key or value?
