Quick Sort and Merge Sort by divide and conquer approach

Quick Sort and Merge Sort by divide and conquer approach

Problem Statement : Write a program for Quick Sort or  Merge Sort implementations using divide and conquer approach. After implementation find the Time complexity for the written Algorithms.

 

 

Merge Sort by divide and conquer approach Code