Which of the following sorting algorithms uses recursion?
2017
Which of the following sorting algorithms uses recursion?
Answer: C. Merge Sort — Answer: Merge Sort (मर्ज सॉर्ट) Merge Sort follows the Divide and Conquer approach: it recursively splits the array into halves, sorts each half, and then…
- A.
Insertion Sort
- B.
Heap Sort
- C.
Merge Sort
- D.
Bubble Sort
Attempted by 1461 students.
Show answer & explanation
Correct answer: C
Answer: Merge Sort (मर्ज सॉर्ट) Merge Sort follows the Divide and Conquer approach: it recursively splits the array into halves, sorts each half, and then merges the sorted halves. Merge Sort में Divide and Conquer का प्रयोग होता है: ऐरे को आधों में बांटकर हर हिस्से को सॉर्ट करने के बाद मिलाया जाता है। Step 1: If the array has 0 or 1 element, it is already sorted (base case).
Loading lesson…