日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程语言 > C# >内容正文

C#

C#实现整数冒泡排序、选择排序

發布時間:2023/12/2 C# 40 豆豆
生活随笔 收集整理的這篇文章主要介紹了 C#实现整数冒泡排序、选择排序 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

????????/// <summary>
??????? /// 交換兩個整數的值
??????? /// </summary>
??????? /// <param name="aa">數1</param>
??????? /// <param name="bb">數2</param>

????private static void Swap(ref int aa,ref int bb)
??????? {
??????????? int temp;
??????????? temp = bb;
??????????? bb = aa;
??????????? aa = temp;
??????? }

?// 冒泡排序
?? class Program
??? {
??????? static void Main(string[] args)
??????? {
??????????? int[] a={1,2,5,7,9,8,10,6,4,3};
??????????? BubbleSort(a);
??????????? for (int i = 0; i < a.Length; i++)
??????????????? Console.Write(a[i] + " ");
??????????? Console.ReadKey();
??????? }

?/// <summary>
??????? /// 冒泡排序
??????? /// </summary>
??????? /// <param name="a">傳入要排序的數組</param>
??????? private static void BubbleSort(int[] a)
??????? {
??????????? for (int i = 0; i < a.Length - 1; i++)
??????????? {
??????????????? for (int j = 0; j < a.Length - i - 1; j++)
??????????????? {
??????????????????? if (a[j] < a[j + 1])//降序排列
??????????????????? {
??????????????????????? Swap(ref a[j], ref a[j + 1]);
??????????????????? }
??????????????? }
??????????? }
??????? }
???}

//選擇排序
?class Program
?{
??????? static void Main(string[] args)
??????? {
??????????? int[] a = { 1, 2,? 4, 3,6,5,7,9,8 };
??????????? SelectionSort(a);
??????????? for (int i = 0; i < a.Length; i++)
??????????????? Console.Write(a[i] + " ");
??????????? Console.ReadKey();
??????? }
??????? /// <summary>
??????? /// 選擇排序
??????? /// </summary>
??????? /// <param name="a">傳入要排序的數組</param>
??????? private static void SelectionSort(int[] a)
??????? {
??????????? int k;
??????????? for (int i = 0; i < a.Length - 1; i++)
??????????? {
??????????????? k = i;
??????????????? for (int j = i+1; j < a.Length ; j++)
??????????????? {
??????????????????? if (a[j] < a[k])//升序排列
??????????????????? {
??????????????????????? k = j;
??????????????????????
??????????????????? }
??????????????? }
??????????????? if(k!=i)
??????????????????? Swap(ref a[i], ref a[k]);
??????????? }
??????? }
?????}

--摘自zhouhb

轉載于:https://www.cnblogs.com/wangliqiang1026/p/4332068.html

總結

以上是生活随笔為你收集整理的C#实现整数冒泡排序、选择排序的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。