What is the complexity of arrays sort?
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 is the parent class of list<e> class?
List the limitations of linear probing?
What is bubble sort and selection sort?
Define a full binary tree ?
What is list and types of list?
What is bubble sort algorithm?
How do you increase the capacity of an arraylist?
Does treemap allow null key?
What are the advantages of array?
Which programming language is best for data structures?
What is the difference between static and dynamic data?