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
- 66833 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / punit
(n+1)/2
saurav is right.
| Is This Answer Correct ? | 28 Yes | 1 No |
Post New Answer View All Answers
Explain the implementation of an AVL tree and Binary tree.
Why do we need linked lists?
When is a graph said to be weakly connected?
What is linked list with example?
Is a hashmap a dictionary?
What is the difference between one and two dimensional?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
What are the 4 types of data?
What is binary tree? Explain its uses.
What do you mean by general trees?
How to excel in data structures and algorithms?
How to increase stack limit in w3wp.exe?
What are the advantages of linked list over array (static data structure)?
What is a reverse linked list.
Can we store a string and integer together in an array?
