What are different types of sorting algorithms?
No Answer is Posted For this Question
Be the First to Post Answer
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.
Which sorting technique is best?
What is the purpose of thread?
What is bubble sort in data structure?
Which data structure is needed to convert infix notations to post fix notations?
Is list same as array?
How do you perform a merge sort?
Why sorting is used?
Differentiate between file and structure storage structure.
What is priority queue in data structure?
Define path in a graph?
What is the difference between arrays sort and collections sort?