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
- 67474 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
Write an algorithm to show various operations on ordered list and arrays
What is sorting and its types?
which is the simplest file structure? (Sequential, indexed, random)
How do you find the number of comparisons in bubble sort?
how to delete first node from singly linked list?
What is declaring array?
What is the difference between hashmap and linkedhashmap?
What is a data structure definition?
Is hashmap keyset ordered?
Differentiate between singly and doubly linked lists?
What is a string array?
What are the advantages of linked list?
What is the difference between arraylist and linkedlist?
What are the different types of data structures?
How can you implement a stack?
