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
- 66757 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
Explain heapsort. What is its complexity?
Can sets contain duplicates?
What is the purpose of sorting algorithms?
Is list a data structure?
What is two-dimensional array?
What is the impact of signed numbers on the memory?
What is a subtree in data structures?
Explain set interface?
Where the data structures are used?
Does treeset allow null values?
Describe stack operation.
How do signed and unsigned numbers affect memory?
Write the stack overflow condition.
What are the four characteristics of algorithms?
Explain quick sort and merge sort algorithms.
