The two main recursive sorting algorithms we'll study in this course are mergesort and quicksort, which are both divide-and-conquer algorithms. Select the phases of the general divide-and-conquer sorting approach in the correct order below. Step 1 Choose ) [Choose Combine the results of the previous step into a single result. Step 2 Split the input into two or more parts. Recurse on each part separately. Step 3 [ Choose )

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.