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
- 66870 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / ruchi baghel
it require n comparison where n=position of the element
if element is on 50th position
we just require 50 comparison bcz it is sequential search
one by one
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
What is stack in data structure with the example?
Can a tree be empty?
Difference between arrays and linked list?
What is data algorithm?
Which sorting algorithm is best for large data?
What is selection sort with example?
What is complete binary tree in data structure?
Is any implicit arguments are passed to a function when it is called?
Write the importance of hashing?
Differentiate between singly and doubly linked lists?
What are the tasks performed during inorder traversal?
Is a list an array?
Can treeset contain duplicates?
Which of the collections allows null as the key?
Is treeset thread safe?
