Interested to Buy Any Domain ? << Click Here >> for more details...
The element being searched for is not found in an array of
100 elements. What is the average number of comparisons
needed in a sequential search to determine that the element
is not there, if the elements are completely unordered?
- 11 Answers
- 35104 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / pavan
100
| Is This Answer Correct ? | 19 Yes | 4 No |
Post New Answer View All Answers
Define distributed query and linked server?
What is data in computer science?
Why is sorting and classifying important?
State the advantages of using postfix notations?
Can arraylist have duplicates?
Which algorithm is used in collections sort method?
write an algorithm to show the procedure of insertion into a b-tree?
Explain merge sort algorithms.
Why quicksort is called quick?
How does hashset work internally in java?
What is array and its types?
Tell me the difference between structure and array?
What the principle of quick sort and its complexity?
What do you mean by hash table?
which is the simplest file structure? (Sequential, indexed, random)
