Hi - Here is the question

Select 2 divide-and-conquer sorting algorithms, and compare them to a standard sorting algorithm.

Complete the following: 1) Compare time complexities 2) Discuss how the divide-and-conquer approach is used to reduce the overall time complexity.

Expectations :

a ) Answer should be at least 600700 words that respond to the above questions with your thoughts, ideas, and comments

b) Need to be strictly in APA format