Which of the following sorting algorithms is a divide and conquer algorithm like Merge Sort?

What is the worst case time complexity of merge sort?

What is the non-recursive formula for merge sort?

What is the main advantage of merge sort?

What is the average-case time complexity of Merge Sort?

Which sorting algorithm is faster for large datasets, bubble sort or merge sort?

Which sorting algorithm is faster for small datasets, bubble sort or merge sort?

What is the main disadvantage of merge sort?

Which data structure is used in the implementation of merge sort?

What is the time complexity of Divide function in Merge Sort algorithm?

Which of the following is not a step in the Merge Sort algorithm?

What is the best case time complexity of Merge Sort algorithm?

In Merge Sort algorithm, what does 'merge' step do?

What is Merge Sort algorithm used for?

What is the advantage of Merge Sort algorithm over other sorting algorithms?