Interested to Buy Any Domain ? << Click Here >> for more details...
How do you solve a selection sort?
- 0 Answers
- 872 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
How many types of arrays are there?
Which of the collections allows null as the key?
What are linked lists most commonly used for?
Define linear probing?
what is the need of data structure
What are binary search and fibonacci search?
Is hashmap get thread safe?
What is sorting with example?
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 the space complexity of bubble sort?
What are the different binary tree traversal techniques?
What is stack push?
Windows 
