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?
Answer Posted / pavan
100
| Is This Answer Correct ? | 19 Yes | 4 No |
Post New Answer View All Answers
Is binary tree balanced?
Differentiate linear from non linear data structure?
Which is better merge or quick sort?
Is json a data structure?
Is python good for freshers?
Differentiate bfs and dfs?
What is the idea behind splaying?
Tell me why might quick sort might be better than merge sort?
Is hashmap keyset ordered?
What are linked lists good for?
Explain how is linked list implemented?
Will hashmap allow null keys?
Write a code for dynamic allocation of array.
Have you ever used HashTable and Directory?
What are the disadvantages of circular list?