Program Quick Sort Ascending C++

Berikut Codingnya... Program Quick Sort Ascending



#include <iostream.h>
#include <conio.h>

void quicksort( int arr[], int left, int right)
{
int i=left, j=right;
int tmp;
int pivot=arr[(left+right)/2];

while(i<=j)
{
while(arr[i]<pivot)
i++;
while(arr[j]>pivot)
j--;
if(i<=j)
{
tmp=arr[i];
arr[i]=arr[j];
arr[j]=tmp;
i++;
j--;
}
}

if(left<j)
quicksort(arr,left,j);
if(i<right)
quicksort(arr,i,right);
}

void main()
{
int arr[100];
int i,n,lb,ub;
lb=0;
cout<<"PROGRAM QUICK SORT ASCENDING\n";
cout<<"_____________________________ \n\n";
cout<<"masukkan banyak data yang di urut: "; cin>>n;

ub=n;
cout<<"masukkan data-datanya: \n\n";
for(i=1; i<=n; i++)
{
cout<<"\tdata ke- "<<i<<" : "; cin>>arr[i];
}

quicksort(arr,lb,ub);
cout<<"\nHasil pengurutan data: ";
for(i=1; i<=n; i++)
cout<<" "<<arr[i];
getch();
 }