Hello.
This jobs ?
#include <iostream>
using namespace std;
void quick_sort(int a[], int length)
{
if (length > 1)
{
int *left=a, *right=&a[length - 1], dir=1;
while (left != right)
{
for (;*left * dir< *right * dir;right-=dir);
swap(*left, *right);
swap(left, right);
dir = -dir;
}
quick_sort(a, left - a);
quick_sort(left + 1, length - 1 - (left - a));
}}
int main() {
int a[]= {1,10,6,7};
quick_sort(a,4);
for(int i=0;i<4;i++)
cout<<a[i];
return 0;}