Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons needed in a
sequential search to determine the position of an element in
an array of 100 elements, if the elements are ordered from
largest to smallest?
- 19 Answers
- 67472 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / ruchi baghel
it require n comparison where n=position of the element
if element is on 50th position
we just require 50 comparison bcz it is sequential search
one by one
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
What actions are performed when a function returns?
What is the difference between list and arraylist?
What's the difference between an array and vector?
What is space complexity of a program?
What is sort function?
Mention the steps to insert data at the starting of a singly linked list?
Does list allow null values?
What is array simple?
Why might quick sort might be better than merge sort?
What are arrays used for?
What are some of the best practices relating to the java collection framework?
What is array indexing?
What is the difference between hashset and hashtable?
What is map keyset?
How to find the missing element in integer array of 1 to 7?
