퀵정렬 구현

1 C

#include <stdio.h>
#define SIZE 10
int arr[SIZE] = {3,4,2,1,7,5,8,9,0,6};
void swap(int i, int j) {
	int temp = arr[i];
	arr[i] = arr[j];
	arr[j] = temp;
}
int partition(int left, int right, int pivot) {
	int original_right = right;
	while(1) {
		while( arr[++left] < pivot ) {}
		while( right>0 && arr[--right]>pivot ) {}
		if( left >= right ) break;
		swap( left, right );
	}
	swap( left, original_right );
	return left;
}
void quick_sort(int left, int right) {
	if(right-left <= 0) return;   
	int partition_point = partition(left-1,right,arr[right]);
	quick_sort( left, partition_point-1 );
	quick_sort( partition_point+1, right );
}
int main() {
	quick_sort(0,SIZE-1);
	for(int i=0; i<SIZE; i++) printf("%d ",arr[i]);
	// 0 1 2 3 4 5 6 7 8 9 
}

2 같이 보기

• 정렬 구현
• 퀵정렬