C # Sort Algorithm Daquan [transfer]

Bubbling Sort I use C # to develop bubble sorting algorithms. 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 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 class mainclass}} public class mainclass}}} public class mainclass}} public class main () {int [] IARRARY = 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 used 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

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 InsertionsRer {Public Class 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 [] IARRARY = new int {1, 13, 3, 6, 10, 55, 98, 2, 87, 12, 34, 75, 33, 47}; INSERTIONSORTER II = New II.Sort (IARRARY); For (int m = 0; M