Friends, I have recently stepped up some algorithms of writing C #. Select sort has been launched. The insertion algorithm is now introduced. 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; public class infrest (int [= 1; i 0) && (List [j-1]> t)) {list [j] = list [j-1]; --j;} list [j] = t;}}} public class mainclass}}} public class mainclass}}} Static void main () {int [] IARRARY = new int = {1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47}; InsertionsRerTer II = New InsertionsRionSorter (); II.Sort (IARRARY); For (int m = 0; M <= 13; M ) console.writeline ("{0}", IARRARY [M]);}} has been compiled. This is too simple I don't make a detailed introduction.
