1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
   | #include "curvelet3d_ridgeletbased.h"
void quicksort(unsigned long n, float arr[]){
	unsigned long i,ir=n,j,k,l=1,*istack;
	int jstack=0;
	float a,temp;
	istack=lvector(1,NSTACK);
	for (;;) {
		if (ir-l < M) {
			for (j=l+1;j<=ir;j++) {
				a=arr[j];
				for (i=j-1;i>=l;i--) {
					if (arr[i] <= a) break;
					arr[i+1]=arr[i];
				}
				arr[i+1]=a;
			}
			if (jstack == 0) break;
			ir=istack[jstack--];
			l=istack[jstack--];
		} else {
			k=(l+ir) >> 1;
			SWAP(arr[k],arr[l+1])
				if (arr[l] > arr[ir]) {
					SWAP(arr[l],arr[ir])
				}
				if (arr[l+1] > arr[ir]) {
					SWAP(arr[l+1],arr[ir])
				}
				if (arr[l] > arr[l+1]) {
					SWAP(arr[l],arr[l+1])
				}
				i=l+1;
				j=ir;
				a=arr[l+1];
				for (;;) {
					do i++; while (arr[i] < a);
					do j--; while (arr[j] > a);
					if (j < i) break;
					SWAP(arr[i],arr[j]);
				}
				arr[l+1]=arr[j];
				arr[j]=a;
				jstack += 2;
				if (jstack > NSTACK) nrerror("NSTACK too small in sort.");
				if (ir-i+1 >= j-l) {
					istack[jstack]=ir;
					istack[jstack-1]=i;
					ir=j-1;
				} else {
					istack[jstack]=j-1;
					istack[jstack-1]=l;
					l=i;
				}
			}
	}
	free_lvector(istack,1,NSTACK);
} | 
Partager