Interested to Buy Any Domain ? << Click Here >> for more details...
Explain quick sort?
- 0 Answers
- 900 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Write the advantage of separate chaining?
Is list same as array?
How can someone display singly linked list from first to last?
What are the applications of linked list?
Is a hashset ordered?
Which sorting algorithm has minimum number of swaps?
Which sorting is stable?
When should structures be passed by values or by reference?
Reverse a linked list from the middle.
Which is the parent class of linkedhashset class?
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 data structure in programming language?
Windows 
