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
- 35610 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
Which is faster quick sort or merge sort?
What is sorting explain?
Tell me the difference between structure and array?
How does quicksort partition work?
What is b tree in data structure?
What member function places a new node at the end of the linked list?
What are the advantages of sorting?
What is huffman’s algorithm?
what are the applications that use Linked lists?
Describe the complexity of Binary search
What is data type explain?
What is collection sort?
What is range search?
What are common data structures?
How treemap orders the elements if the key is a string?
