Rapid type first partitions the array and after that make two recursive calls. Merge type to start with tends to make recursive requires the two halves, and after that merges The 2 sorted halves.QuickSort is often a sorting algorithm dependant on the Divide and Conquer that picks a component to be a pivot and partitions the given array round the pi