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
- 31708 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / pankaj
(sum of all 1 to 100) - (sum of given numbers)= number missing
for this no comparison required
| Is This Answer Correct ? | 4 Yes | 20 No |
Post New Answer View All Answers
What is difference between tree and forest?
What is an recursive algorithm?
Run time memory allocation is known as in data structure?
What are binary trees?
Why concurrenthashmap is fail safe?
What is the difference between Array and LinkedList?
What is the use of sorting the data?
What is the best case complexity of quicksort?
What are the two types of data?
Explain what is B-tree?
What is advantage and disadvantage of linked list?
What is red black tree in data structure?
What is the types of data structure?
Write the steps involved in the insertion and deletion of an element in the stack.
What is a pass in bubble sort?
