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
- 66061 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 best case complexity of bubble sort?
How to increase stack limit in w3wp.exe?
What is array and its types in data structure?
Explain the Array
What is bubble sort algorithm in data structure sort and searching?
Define distributed query and linked server?
What is the Insertion Sort Code?.
Which data structures are used in bfs and dfs algorithm?
How do I sort hashset?
How do I sort a hashmap key?
Define biconnectivity?
Which sort algorithm is best?
Define red-black trees.
What do you mean by secondary clustering?
What does arraylist remove return?
