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
- 66761 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / gianni
sorry, the reduced formula should have been
n(1-p/2)+p/2
I forgot a space between the "to" and the "n"
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the difference between 1d and 2d array?
What is the use of data structure?
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
What is the height of a binary tree?
Does treemap sort on key or value?
What is collections singletonlist?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
How do you determine if a binary tree is height balanced?
Explain extended binary tree.
What is data and its type?
Define circular list?
What is the use of isEmpty() member methods?
Is hashmap faster than arraylist?
What data structure does a binary tree degenerate?
Can we sort hashmap?
