using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace flash_sort { class Program { static void Main(string[] args) { Program p = new Program(); int [] a = new int[7] {1,2,3,6,1,9,7}; p.flashsort(a, 7); } public void flashsort (int []array , int length) { if (length == 0) { return; } int m = (int)((0.2 * length) + 2); Console.WriteLine("m = " + m); int min = 0; int max = 0; int maxIndex = 0; min = max = array[0]; Console.WriteLine("min =" + min); Console.WriteLine("max =" + max); maxIndex = 0; for (int i = 0; i < length - 1; i += 2) { Console.WriteLine(i); int small; int big; int bigIndex; if (array[i] < array[i + 1]) { small = array[i]; big = array[i + 1]; bigIndex = i + 1; } else { big = array[i]; bigIndex = i; small = array[i + 1]; } if (big > max) { max = big; maxIndex = bigIndex; } if (small < min) { min = small; } } if (array[length - 1] < min) { min = array[length - 1]; } else if (array[length - 1] > max) { max = array[length - 1]; maxIndex = length - 1; } Console.WriteLine("point1"); if (max == min) { Console.WriteLine("allare the same"); return; } int[] L = new int[m + 1]; for (int t = 1; t <= m; t++) { L[t] = 0; } Console.WriteLine("point2"); double c = (m - 1.0) / (max - min); int K=0; for (int h = 0; h < length; h++) { K = ((int)((array[h] - min) * c)) + 1; L[K] += 1; } Console.WriteLine("point3"); for (K = 2; K <= m; K++) { L[K] = L[K] + L[K - 1]; } Console.WriteLine("point4"); int temp = array[maxIndex]; array[maxIndex] = array[0]; array[0] = temp; int j = 0; K = m; int numMoves = 0; while (numMoves < length) { Console.WriteLine("1 numMoves = " + numMoves); Console.WriteLine("1 j = " + j); Console.WriteLine("1 L[K] =" + L[K]); while (j >= L[K]) { j++; Console.WriteLine("2 j = " + j); //classify the A(j) value K = ((int)((array[j] - min) * c)) + 1; Console.WriteLine("K = " + K); } Console.WriteLine("point5"); while (j < L[K]) { int evicted=0; K = ((int)((evicted - min) * c)) + 1; int location = L[K] - 1; int Temp = array[location]; array[location] = evicted; evicted = Temp; L[K] -= 1; numMoves++; } Console.WriteLine("numMoves = " + numMoves); Console.WriteLine("3 j = " + j); Console.WriteLine("L[K] =" + L[K]); } Console.WriteLine("point5"); int[] a = new int[7]; int threshold = (int)(1.25 * ((length / m) + 1)); const int minElements = 30; for (K = m - 1; K >= 1; K--) { int classSize = L[K + 1] - L[K]; if (classSize > threshold && classSize > minElements) { flashsort(L ,classSize); } else { if (classSize > 1) { a = insertionSort(L, classSize); } } } L = null; Console.WriteLine(a); } public int[] insertionSort(int[] arr2, int upper) { int inner, temp; for (int outer = 1; outer <= upper; outer++) { temp = arr2[outer]; inner = outer; while (inner > 0 && arr2[inner - 1] >= temp) { arr2[inner] = arr2[inner - 1]; inner -= 1; } arr2[inner] = temp; } return arr2; } } }

Help Hamdan : FlashSort