C#数组反转与排序实例分析

using System;  
using System.Collections.Generic;  
using System.Linq;  
using System.Text;  
  
namespace 数据反转  
{  
    class Program  
    {  
        static void Main(string[] args)  
        {  
            string[] strAllay = { "毛泽东", "李世民", "秦始皇", "成吉思汗", "习近平","邓小平"};  
            string s;  
            for (int i = 0; i < strAllay.Length / 2; i++)//strAllay.Length/2是因为经过（将数组的长度值除以2）次就可以将数组成员进行反转了  
            {  
                s = strAllay[i];  
                strAllay[i] = strAllay[strAllay.Length - 1 - i];//如果i等于数组第一项值（毛泽东）的时候，将它与最后一个值（邓小平）互换。  
                strAllay[strAllay.Length - 1 - i] = s;  
            }  
            foreach (string ss in strAllay)  
            {  
                Console.Write(ss+" " );  
            }  
            Console.ReadKey();  
        }  
    }  
}

using System;  
using System.Collections.Generic;  
using System.Linq;  
using System.Text;  
  
namespace 数组  
{  
    class Program  
    {  
        static void Main(string[] args)  
        {  
            //输出一个数组里的最大的数值；  
            /* 
            int[] arr = new int[] { 10, 9, 15, 6, 24, 3, 0, 7, 19, 1 }; 
            int max = 0; 
            for (int i = 0; i < arr.Length - 1; i++) 
            { 
                if (arr[i] > max) 
                { 
                    max = arr[i]; 
                } 
            } 
            Console.WriteLine(max); 
             **/  
            //按大小顺序输出数组的值  
            int[] list = new int[] { 10, 9, 15, 6, 24, 3, 0, 7, 19, 1 ,100,25,38};  
            /* 
                for (int i = 0; i < list.Length-1; i++) 
                  { 
                      for (int j = i+1; j < list.Length; j++) 
                      { 
                          if (list[i] > list[j]) 
                          { 
                             int temp = list[i]; 
                             list[i] = list[j]; 
                             list[j] = temp; 
                         } 
                     } 
                 }*/  
                /// <summary>  
         /// 插入排序法  
         /// </summary>  
         /// <param name="list"></param>  
          
             for (int i = 1; i < list.Length; i++)  
              {  
                 int t = list[i];  
                 int j = i;  
                 while ((j > 0) && (list[j - 1] > t))  
                 {  
                     list[j] = list[j - 1];  
                     --j;  
                 }  
                 list[j] = t;  
             }  
  
                foreach (int forStr in list)  
                {  
                    Console.Write(forStr + " ");  
                }  
            Console.ReadKey();  
        }  
    }  
}