Interested to Buy Any Domain ? << Click Here >> for more details...
What is reduction to sorting method?
- 0 Answers
- 949 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What are the difference between arraylist and linkedlist from the perspective of sorting?
How do you sort in ascending order in arraylist?
What are the objectives of studying data structures?
What is the need for path compression?
Define a complete binary tree?
Write a program to insert an element and in the specific position in the array?
What are the advantages of modularity?
What are the applications of stack?
Which language is best for data structures?
What is the best complexity of bubble sort?
Is hashmap a collection?
I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.
Windows 
