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
- 67470 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / prasad
n comparisons.
| Is This Answer Correct ? | 9 Yes | 25 No |
Post New Answer View All Answers
What differences exist between hashmap and hashtable?
What is a hashmap in c?
Can arraylist store primitives?
How will you reverse Linked List.
Why might quick sort might be better than merge sort?
Is array a data structure?
What are different dynamic memory allocation technique in c.
List the types of rotations available in splay tree?
Can treeset have duplicates?
What is m way tree in data structure?
How does threaded binary tree represented in data structure?
What are the 4 types of data?
What is the difference between classifying and sorting?
What is an example of an array?
What is the Insertion Sort Code?.
