quick sort1

• 퀵정렬 #include void quick_sort(int a[],int n) { int v,t; int i,j; if(n>1) { v = a[n-1]; i = -1; j = n-1; while(1) { while(a[++i] v); if( i >=j ) break; t = a[i]; a[i] = a[j]; a[j] = t; } t = a[i]; a[i] = a[n-1]; a[n-1] = t; quick_sort(a,i); quick_sort(a+i+1,n-i-1); } } void main() { int q; int a[10] = {6,3,1,4,2,9,7,0,8,5}; quick_sort(a,10); for(q=0;q 프로그래밍 언어/프로그래밍 2009. 1. 18.