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
- 35558 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / mounesh badiger
we have to check all the elements of the array.so average is
n(size of array)
| Is This Answer Correct ? | 14 Yes | 3 No |
Post New Answer View All Answers
What is a bubble sort and how do you perform it?
What is meant by int?
What is data and data structure?
How would you use bsearch() function to search a name stored in array of pointers to string?
Does concat mutate array?
Explain Array of pointers?
What is binary tree example?
Is Arraylist faster than Array? Why?
What is difference between while and do while?
What is the difference between array and stack in data structures?
How arraylist increase its size?
How is bubble sort done?
If you do not initialize an array what will happen?
What is a multidimensional array?
What is difference between hashset and linkedhashset?
