C # Some sorting algorithms

Bubble Sort

Learning language to spend vigorously gas data structure and algorithm.

Using system;

Namespace bubblesorter {public class bubblesorter {public void sort (int [] list) {INT i, J, TEMP; BOOL DONE = false; j = 1; while (j list [i 1]) {done = false; temp = list [i]; list [i] = List [i 1]; list [i 1] = TEMP;}} J ;

}}} public class mainclass {public static void main () {int [] ararary = new int [] {1, 5, 13, 6, 10, 55, 99, 2, 87, 12, 34, 75, 33, 47 }; Bubblesorter sh = new bubblesorter (); sh.sort (IARRARY); For (int m = 0; M

Select Sort I use C # to develop a sequencing algorithm. I hope to bring some benefits to learners in C # language. Don't forget, learn the language to spend vigorous gas data structure and algorithm.

Using system;

Namespace SelectionSORTER {public class selectionsorter {private int min; public void sort (int [] list) {for (int i = 0; i

}}} public class mainclass {public static void main () {int [] IARRARY = new int [] {1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 }; SelectionSORTER SS = New SelectionSORTER (); SS.Sort (IARRARY); For (int m = 0; M

}}}

Insert order

Insert the sort algorithm. For friends who want to improve C # language programming capabilities, we can explore each other. Such as: The following procedure is not realized, come to help it implement.

Using system;

Namespace INSERTIONSORTER {public void sort (int [] list) {for (int i = 1; i 0) && (List [j-1]> t)) {list [j] = list [j-1]; - j;} list [j] = t;}

}} public class mainclass {public static void main () {int [] arary = new int [] {1, 13, 3, 6, 10, 55, 98, 2, 87, 12, 34, 75, 33, 47 }; INSERTIONSORTER II = New InsertionsR (); II.Sort (IARRARY); For (INT M = 0; M

Hill sort is sorted to insert the group, inserted. For friends who want to improve C # language programming capabilities, we can discuss each other. Such as: The following procedure is not realized, come to help it implement.

Using system;

Namespace shellsorter {public class shellsorter {public void sort (int [] list) {int Inc; for (inc= 1; inc, = list.length / 9; inc= 3 * inc 1); for (; inc> 0 ; inc / = 3) {for (INT i = inc 1; i <= list.length; i = inc) {INT T = List [i-1]; int J = i; while ((j> inc) && (List [J-INC-1]> T)) {List [J-1] = List [J-INC-1]; J- = Inc;} List [J-1] = T;}}}} Public class mainclass {public static void main () {int [] IARRARY = new int = {1, 5, 13, 6, 10, 55, 99, 2, 87, 12, 34, 75, 33, 47}; ShellsRer sh = new shellsorter (); sh.sort (IARRARY); For (int m = 0; m