Interested to Buy Any Domain ? << Click Here >> for more details...
Which sorting technique is best in worst case?
- 0 Answers
- 899 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
How can we reverse the order in the treemap?
Write an algorithm to show various operations on ordered list and arrays
Can treemap have null values?
What is time complexity of binary search?
create an singly linked lists and reverse the lists by interchanging the links and not the data?
What you mean by sorting?
How do you do binary search?
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 do you mean by selection sort?
What is a node in it?
What are different sorting algorithms?
What is a property class?
Windows 
