Quick Sort & Wave Sort in C++

By Ishan Dubey

A sorting algorithm is used to rearrange the array according to the user requirements, such as ascending or descending order or even the wave form.

A sorting algorithm is used to rearrange the array according to the user requirements, such as ascending or descending order or even the wave form.

In this packet, I created two such sorting algorithms named Quicksort and Wave sort.

Quick Sort:

This Sorting algorithm works on the divide and conquers algorithm. This sorting algorithm has one pivot element and partition which are used to sort the given array.

 

Wave Sort:

A wave sort algorithm is one of the most unique algorithms as it does not sort an array in the usual ascending or descending form instead it forms a wave-like function of the array.