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
- 66080 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / dj
Answer is log n (base 2), Maximum camparision required to
search the array of 100 elments is 8. ( modified binary
search)
| Is This Answer Correct ? | 10 Yes | 7 No |
Post New Answer View All Answers
What do you mean by breadth first search (bfs)?
What do you mean by structure property in a heap?
Define Data Structures?
Name few concurrent collection classes?
Can we search the data in a linked list?
What is heap tree in data structure?
Is hashmap a collection?
What sort of serious problems have you experienced, and how have you handled them?
What is complexity of bubble sort?
Can we insert null in hashset?
What are three common types of traversals?
What is collections singletonlist?
What are the advantages and disadvantages of copyonwritearraylist?
What method is used to place a value onto the top of a stack?
In what order the elements of a hashset are retrieved?
