(Solved) : Need Help Implementing Testing Quick Sort Function C Provided Code Able Compare Performanc Q29362094 . . . .

I need help implementing and testing a quick sort function forC++ from the provided code and be able to compare the performanceof my quicksort program and the provided Selection sort algorithmto find the best-case scenario using different pivots.

There may be several functions in your quicksort1.cpp (such asthe partition function). But quick1.h must only have ONE prototype(the prototype for the quicksort function). Any other functionsthat are in quicksort1.cpp should be declared with “internallinking”. This hides the function name from the linker, and isaccomplished by placing the word static before the functionprototype and before the function definition. For example: staticvoid partition(int data[