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
- 35581 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / siya
100 comparisons
| Is This Answer Correct ? | 7 Yes | 3 No |
Post New Answer View All Answers
Can hashset contain duplicates?
Explain the uses of binary tree.
What are different techniques for making hash function?
What is example of data?
What is the quickest sorting algorithm?
Explain the types of linked lists.
What is complexity algorithm?
What is nsmutablearray?
What is ds heap sort?
What do you mean by open addressing?
Why do we use hashset?
What is a bubble sort and how do you perform it?
What is dynamic array with example?
Explain linear linked implementation of Stack and Queue?
What are lists?
