Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / srinvias
Merge sort. In all the cases the complexity is nlogn
For Quick sort complexity is o(n^2), nlogn in worst and best
cases respectively.
| Is This Answer Correct ? | 14 Yes | 5 No |
Post New Answer View All Answers
Does treeset allow duplicates?
What is huffman’s algorithm?
What is hashing in cyber security?
Why is quicksort not stable?
What is bubble sort?
How do you sort in ascending order in arraylist?
Which is better arraylist or linkedlist?
Is arraylist heterogeneous?
Which is the parent class of abstractsequentiallist class?
What is fibonacci search?
Why is hashmap not thread safe?
What are the Difference between tcp and udp?
Does mentioning the array name gives the base address in all the contexts?
What is pointer in data structure?
What is the minimization factor and time complexity of b-tree?
