Explain merge sort algorithms.
- 0 Answers
- 566 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
Can you make an arraylist of arrays?
What is the minimum number of queues that can be used to implement a priority queue?
What is a hashers run?
When is a binary search algorithm best applied?
Does arraylist shrink?
Can treeset contain duplicates?
What do you mean by data and data structure?
What do you mean by: Syntax Error, Logical Error, Runtime Error?
7 Answers College School Exams Tests, Microsoft,
What is time complexity of sorting algorithms?
What is the difference between adt and data structure?
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 
