选择排序

来源:互联网 发布:吃鸡优化教程 编辑:程序博客网 时间:2024/04/29 04:04

 

 

学习用,有错请指点啊^ ^

 

 class Program
    {
        static void Main(string[] args)
        {
            Console.Write("请输入数组的中元素的个数n=");
        
            int n = 0;
            try
            {
                n = int.Parse(System.Console.ReadLine());
            }
            catch (Exception ex)
            {
                Console.WriteLine(ex);
            }
            if (n >= 0)
            {
                int[] a = new int[n];
                for (int i = 0; i < n; i++)
                {
                    int flag = 1;
                    while (flag == 1)
                    {
                        Console.Write("请输入数组的值a[" + i + "] = ");
                        try
                        {
                            a[i] = int.Parse(System.Console.ReadLine());
                            flag = 2;
                        }
                        catch (Exception ex)
                        {
                            Console.WriteLine(ex + "请输入整数!");
                            flag = 1;
                        }
                    }
                }
                Program prm = new Program();
                prm.selection_sort(a, n);
            }
            else
            {
                Console.WriteLine("元素的个数n要大于零");
            }
            System.Console.Read();
        }

        public void selection_sort(int[] a, int n)
        {
            int i, j, k;
            int t;
            for (i = 0; i < n-1; i++)
            {
                k = i;
                for (j = i+1; j < n; j++)
                {
                    if (a[k] > a[j])
                    {
                        k = j;
                    }
                }
                t = a[i];
                a[i] = a[k];
                a[k] = t;
            }
            for (int s = 0; s < n; s++)
            {
                System.Console.WriteLine(a[s]);
            }
        }
 

原创粉丝点击