What is the complexity of arrays sort?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

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.

3 Answers  


Which is the parent class of list<e> class?

0 Answers  


List the limitations of linear probing?

0 Answers  


What is bubble sort and selection sort?

0 Answers  


Define a full binary tree ?

0 Answers  






What is list and types of list?

0 Answers  


What is bubble sort algorithm?

0 Answers  


How do you increase the capacity of an arraylist?

0 Answers  


Does treemap allow null key?

0 Answers  


What are the advantages of array?

0 Answers  


Which programming language is best for data structures?

0 Answers  


What is the difference between static and dynamic data?

0 Answers  


Categories