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
- 66891 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
Can you please explain the difference between array_name and &array_name?
Why linked list is required?
Is list a data structure?
What is sorting with example?
Define secondary clustering?
Why is quicksort better than mergesort?
What is circular linked list?
What member function places a new node at the end of the linked list?
What is b tree in data structure?
What is an recursive algorithm?
Explain multiply linked list in short.
What are different types of linked lists?
How many parts are there in a declaration statement using data structures?
How do you sort large data?
What is linear-logarithm chasm?
