C#算法Code基础知识.pdfVIP

算法 冒泡排序 bubble sorting int t; int [] a ={21,56,64,94,97,123}; for ( int j =a.Length-1;j0;j--) { for ( int i =0;ij;i++) { if (a[i]a[i+1]) { t =a[i]; a[i]=a[i+1]; a[i+1]=t; } } } for ( int u =0;ua.Length;u++) Console.WriteLine(a[u]); 结果 :21,56,64,94,97,123 同时找最大最小 int temp; int [] a={56,66,5,1230,87,95}; for ( int i =0;i(a.Length+1)/2;i++) { if (a[i]a[a.Length-1-i]) { temp =a[i]; a[i] =a[a.Length-1-i]; a[a.Length-1-i] =temp; } } int max =a[a.Length-1],min =a[0]; for ( int i=0;i(a.Length+1)/2;i++) { if (mina[i]) min =a[i]; } for ( int i =(a.Length+1)/2;ia.Length;i++) { if (maxa[i]) max =a[i]; } Console.WriteLine({0},{1},min,max); 结果： 5,1230 基数排序 int [] a={1,5,9,7}; int [] b= new int [10]; for ( int i=0;ia.Length;i++) b[a[i]]=1; for ( int j=0;jb.Length;j++) if (b[j]==1) Console.WriteLine(j); 结果： 1,5,7,9 插入排序 int [] r={12,2,6,65,42}; for ( int i=1;ir.Length;i++) { int t; t=r[i]; int j; for (j=i-1;j=0 r[j]t;j--) {}