Quick Sort Java

public class Quicksort{

   public static void qsort(Comparable[] c,int start,int end){
       if(end <= start) return;
       Comparable comp = c[start];
       int i = start,j = end + 1;
       for(;;){
           do i++; while(i<0);
           do j--; while(j>start && c[j].compareTo(comp)>0);
           if(j <= i)   break;
           Comparable tmp = c[i];
           c[i] = c[j];
           c[j] = tmp;
       }
       c[start] = c[j];
       c[j] = comp;
       qsort(c,start,j-1);
       qsort(c,j+1,end);
   }

   public static void qsort(Comparable[] c){
       qsort(c,0,c.length-1);
   }

   public static void main(String[] args){
       int i;
       Integer[] arr = new Integer[20];
       System.out.println("inserting: ");
       for(i=0;iinserting:
58 52 82 27 23 67 37 63 68 18 95 41 87 6 53 85 65 30 10 3
sorted:
3 6 10 18 23 27 30 37 41 52 53 58 63 65 67 68 82 85 87 95
Done ;-)