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
- 31757 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Post New Answer View All Answers
Can we add or delete an element after assigning an array?
Define a relation?
Is heap sort adaptive?
Tell me the difference between structure and array?
What is a priority queue?
What are control structures?
Why is it called bubble sort?
What is difference between array and arraylist?
Can arraylist be empty?
Name few collections map implementations?
What is circular queue example?
What is binary search in programming?
Two linked lists are given, find out the sum of them without altering the linked list?
Why is hashing used?
What is an example of an algorithm?
