QuickSort

quicksort.c

void quickSort(int a[ ], int from, int to)‏
{       	//      	sort partition  from ... to  of array a
        	int i, pivot, new_val;

        	if (from < to)	//  	at least 2 elements in partition
		{
			pivot = from;
 			for (i = from + 1; i <= to; i++)‏
                	{
                        		new_val = a[i];
                        		if (new_val < a[pivot])‏
                        		{       	//      	shift values to the right
                                		a[i] = a[pivot+1];
                                		a[pivot+1] = a[pivot];
                                		a[pivot] = new_val;
                                		pivot++;
                        		}       	//      	else a[i] stays put
                	}
                	quickSort(a, from, pivot-1);   // left   partition
                	quickSort(a, pivot+1, to);      // right partition
        	}       	//     	else (from >= to) only 0 or 1 elements
}	//  end quicksort