源码网商城,靠谱的源码在线交易网站 我的订单 购物车 帮助

源码网商城

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

  • 时间:2020-12-11 22:10 编辑: 来源: 阅读:
  • 扫一扫,手机访问
摘要:C#数组反转与排序实例分析
本文实例分析了C#数组反转与排序的方法。分享给大家供大家参考。具体实现方法如下: C#数组反转
[u]复制代码[/u] 代码如下:
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();          }      }  }
C#数组排序:
[u]复制代码[/u] 代码如下:
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();          }      }  }
希望本文所述对大家的C#程序设计有所帮助。
  • 全部评论(0)
联系客服
客服电话:
400-000-3129
微信版

扫一扫进微信版
返回顶部