namespace QuickSort { class QuickSort { public static void Sort(int[] array) { DoSort(array,0, array.Length-1); } private static void DoSort( int[] array, int start, int end) { if( start < end) { int temp = Partition(array, start, end); DoSort(array, start, temp-1); DoSort(array, temp + 1, end); } } private static int Partition(int[] array,int start, int end) { int index = start - 1; for( var i=start; i< end; i++) { if( array[i] < array[end]) { index++; Swap(array, index, i); } } Swap(array, index +1, end); return index + 1; } private static void Swap(int[] array, int index1, int index2) { var temp = array[index1]; array[index1] = array[index2]; array[index2] = temp; } } }