🎴 Flashcard Mode
Sorting Algorithms
Card1 / 15
Mastered0
Review0
QuestionClick to flip
Which sorting algorithm is known for its divide-and-conquer approach, where it repeatedly divides the input array into smaller subarrays until they are sorted and then merges them back together?
AnswerClick to flip back
A
Merge Sort
💡 Explanation:
Merge Sort follows a divide-and-conquer strategy, dividing the input array into smaller subarrays, sorting them recursively, and then merging them back together to obtain the sorted array.