Algorithm---Insert Sort

       Hi,all,let's take a few minutes to write this Insert Sort algorithm down,the ideas is:definition a guard to store the original sorted array in this guard,assume the first num in the sorting data array is sorted,then guard loop to the end of this array,every per loop we will insert the new num to the sorted array and make the new array sorted,in the end the whole array is sorted,that's all.

       the algorithm as follow:

 

/// <summary> /// Insert Sort Method /// </summary> /// <param name="data">original array</param> /// <param name="count">array length</param> public void InsertSort(int[] data, int count) { //def the guard int temp; //assume the first num is sorted for (int i = 1; i < count; i++) { //stored the original sorted array in temp temp = data[i]; for (int j = i; j > 0; j--) { //swap data[j] and data[j-1] if(temp<data[j-1]) { data[j] = data[j - 1]; data[j - 1] = temp; } } } }

 

and there is another algorithm as follow:this one is familiar with the up one.

 

  /// <summary> /// Insert Sort Method 2 /// </summary> /// <param name="data">original array</param> /// <param name="count">array length</param> public void InsertSort2(int[] data, int count) { //def the guard int temp, k = 0; //assume the first num is sorted for (int i = 1; i < count; i++) { //store the data[i] : data[i] will be insert to the sorted array temp = data[i]; k = 0; for (int j = i; j > 0; j--) { if (temp < data[j - 1]) { //move to behind data[j] = data[j - 1]; //record the index j k = j; } } //insert the temp num if (k > 0) data[k - 1] = temp; } }

 

easy,simply.

over.