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
- 61162 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / saurav
i dont think the above answer is correct..it should be (N+1)/2
according to me..if my answer is not correct,can anyone
explain me the reason..
| Is This Answer Correct ? | 54 Yes | 4 No |
Post New Answer View All Answers
Define linked list data structure.
What is red black tree in data structure?
How does shell sort work?
Differentiate between queue and deque.
What is the height of binary tree?
Can you sort a string?
How do you find the second largest element in an array of integers?
Can you dynamically allocate arrays in expanded memory?
What sorting algorithm should be used for sorting strings?
Why do we use stacks?
How arraylist increase its size?
Tell me the difference between the character array and a string.
List the applications of stacks?
What are some of the best practices relating to the java collection framework?
Is there any difference between int[] a and int a[]?
