interview_quicksort

gistfile1.txt

package io.github.kimmking;

import java.lang.*;

class QuickSort
{
    public static void main (String[] args) throws java.lang.Exception
    {
        int[] array = new int[]{5,1,6,2,4,3,8,9,0,10};
        quickSort(array,0, array.length-1);

        for (int i : array) {
            System.out.print(i + ",");
        }
        System.out.println();
    }

    private static void quickSort(int[] arr,int start,int end){
        if(start >= end ) return;
        int c = start;
        int current = arr[c];

        for (int i = start+1;i<=end;i++){
            if(arr[i]<current){
                arr[c] = arr[i];
                arr[i] = arr[c+1];
                arr[c+1] = current;
                c++;
            }
        }

        quickSort(arr,start,c-1);
        quickSort(arr,c+1,end);
    }

}