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
Name few classes that implement collection interface?
What is complexity of quicksort?
Define a stack?
Differentiate bfs and dfs?
What do you mean by primary clustering?
What is data type in data structure?
Is heap sort adaptive?
What is the time complexity of arraylist and linked list?
Does hashmap allow null keys?
What is the use of isEmpty() member methods?
Describe tree database.
Why is data structure needed?
Can nsarray contain nil?
How will you check the validity of an expression containing nested parentheses?
Can we insert null in set?
