Interested to Buy Any Domain ? << Click Here >> for more details...
Why heap sort is not used?
- 0 Answers
- 823 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Define primary data structures?
Can you override methods of arraylist?
What is a vector element?
Can arraylist be null?
What method is used to place a value onto the top of a stack?
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.
What is ascending and descending order?
Can we give size to arraylist?
Which sorting algorithm is the slowest?
What is adt in data structure?
What are the complexity of binary search?
What is a hashset?
Windows 
