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
- 61181 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 is the Insertion Sort Code?.
What is complexity of quicksort?
What do you mean by balanced trees?
What is raid (redundant array of inexpensive disks)?
What is weight balanced tree in data structure?
Can arraylist have duplicates?
Which is faster binary or linear search?
How to inverting a function in sort and searching?
What are the applications of graph data structure?
Why do we use sorting?
How memory is reserved using a declaration statement ?
Does mentioning the array name gives the base address in all the contexts?
Define dynamic data structures?
What are the scenarios in which an element can be inserted into the circular queue?
What is linear and non linear structure?
