Quicksort (int data[],int left,int right) { int mid,tmp,i,j; int data[]; i = left; j = right; mid = data[(left + right)/2]; do { while(data[i] < center) i++; while(center < data[j]) j--; if (i <= j) { tmp = data[i]; data[i] = data[j]; data[j] = tmp; i++; j--; } } while (i <= j); if (left < j) Quicksort(data,left,j); if (i < right) Quicksort(data,i.right); }