(Solved) : 50 Implement Quick Sort Algorithm Quicksortcpp Expected Implement Three Functions Swap Par Q32161653 . . . .

(50’) Implement Quick-Sort algorithm in quickSort.cpp, where youare expected to implement three functions, swap(), partition() andquickSort(). You are expected to call swap() within partition(), tocall partition() within quickSort(), and you are not expected todeclare/ implement other additional functions nor change the main()function. OPTIONAL: If you don’t need/ want to use swap() in yourimplementation, that is fine. Just delete/ comment it.

quickSort.cpp

#include <iostream>

using namespace std;

// A helper function to facilitate swapping two int elements

// You might want to use this function in the functionpartition().

void swap(int& a, int& b)

{

}

// This function partitions sub-array A[p..r]. It takes lastelement in the sub-array, i.e., A[r], as