Quick sort code implementation

Quick sort

In the following example , Select the last element 40 As a median .i Used to traverse the subscript of the array ;k Representation ratio 40 The subscript of the small element to be saved

int Partition(int* arr, int left, int right) {
    
	int k, i;
	for (i = k = left; i < right; i++) {
    
		if (arr[i] < arr[right]) {
    
			swap(arr[k], arr[i]);
			k++;
		}
	}
	swap(arr[k], arr[right]);
	return k;
}

// Recursive implementation of quick sorting 
void QuickSort(ElemType A[], int low, int high) {
    
	if (low < high) {
    
		int pivotpos = Partition(A, low, high);// The elements to the left of the split point are smaller than the split point , The elements on the right of the split point are larger than the split point 
		QuickSort(A, low, pivotpos - 1);
		QuickSort(A, pivotpos + 1, high);

	}
}

Click download source