re.c

A order algoritm comparison by the C time(). Comparison beetwen : insort,selection sort,mergesort,

public static void newsort (long[] A) {
                if (A.length < 128) {
                    insertion(A);
                    }
                else {mergesort(A);}
                }
                
                
public static void Merge (long[] A,int p , int q , int r) { ////
			
                        
                        long [] temp = new long[r-p+1];
            if (temp.length < 128 ) {
                insertion(temp); }
                else {
			int i = p;
			int j = q+1;
			int k = 0;
			while ( i<=q && j <= r ) {
				if (A[i] < A[j]) {
					temp[k] = A[i];
					i=i+1;
					}
					else{
					temp[k] = A [j];
					j=j+1;
					}
				k=k+1;
				} // fine while
			if ( i > q && j <= r) {
				for (int h = j ; h <= r ; h++){
					temp[k] = A[h];
					k=k+1;
					}
				} // fine if
			if ( i <= q && j > r) {
					for (int h = i; h <=q; h++){
						temp[k]=A[h];
						k=k+1;
						}
				}// fine if
                                
                    }// fine aggiunta
				
		for (int z = 0; z <= temp.length-1; z++){
			A[p+z]=temp[z];
			}
			
	} ////