首页 > 编程语言 > 详细

冒泡排序

时间:2019-11-22 16:44:58      阅读:93      评论:0      收藏:0      [点我收藏+]
static void Main(string[] args)
        {
            //数组的基本写法
            //1.
            //int[] str_num =new int[5];
            //str_num[0] = 1;
            //str_num[1] = 2;
            //2.
            //int[] str_num1 = { 1, 2, 3, 4, 5 };

            int[] str_num = { 3, 2, 1, 5, 4 };
            int at_set1 = 0;
            int at_set2 = 0;
            string at_model = null;
            //冒泡排序
            for (int i = 0; i < str_num.Length; i++)
            {
                for (int j = i+1; j < str_num.Length; j++)
                {
                    at_set1 = str_num[i];
                    at_set2 = str_num[j];
                    if (at_set1 > at_set2)
                    {
                        str_num[i] = at_set2;
                        str_num[j] = at_set1;
                    }
                    at_set1 = 0;
                    at_set2 = 0;
                }
                at_model += str_num[i]+",";
            }
            at_model = at_model.Substring(0, at_model.Length - 1);//去除字符串最后一个字符
            Console.WriteLine("值为:{0}", at_model);
            Console.ReadKey();
        }

记录学习!

冒泡排序

原文:https://www.cnblogs.com/lysouko/p/11912106.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!