快速排序實現

public void quicksort(int arr[],int L,int R){

int i = L;

int j = R;

int pivot = arr（[L+R]/2）;

while(i<=j){

    while(arr[i]<arr[pivot]){

    i++;

}

    while(arr[j]>arr[pivot]){

    j--;

}

if(i<=j){

int temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

}

}

quicksort(arr,L,j);

quicksort(arr,i,R);

}



int main(){

int arr[] = {6,7,8,4,3,2,9,1,3};

int i;

quicksort(arr,0,8);

for(int i=0;i<9;i++){

System.out.println(arr[i]);

}

}