• c# 排序


    using System;
    using System.Collections.Generic;
    using System.Linq.Expressions;
    
    namespace ConsoleApplication
    {
        struct Aaa
        {
            public int _red;
            public int _green;
            public int _blue;
        }
    
        internal class Program
        {
            public static void Main(string[] args)
            {
                var arr = new int[] {3, 4, 77, -1, 0, 9, 7, -999, 2, 4};
                Array.Reverse(arr);
    //            Array.Sort(arr);
    //            BubbleSort(arr);
                PrintArray(arr);
            }
    
    
            #region 工具方法
            /// <summary>
            /// 选择排序
            /// </summary>
            /// <param name="arr"></param>
            private static void Sort(int[] arr)
            {
                for (int i = 0; i < arr.Length - 1; i++)
                {
                    for (int j = i + 1; j < arr.Length; j++)
                    {
                        if (arr[i] > arr[j])
                        {
                            Swap(ref arr[i], ref arr[j]);
                        }
                    }
                }
            }
            /// <summary>
            /// 冒泡排序
            /// </summary>
            /// <param name="arr"></param>
            private static void BubbleSort(int[] arr)
            {
                for (int i = 0; i < arr.Length - 1; i++)
                {
                    for (int j = 0; j < arr.Length-1-i; j++)
                    {
                        if (arr[j] > arr[j+1])
                        {
                            Swap(ref arr[j], ref arr[j+1]);
                        }
                    }
                }
            }
    
            /// <summary>
            ///交换两个值
            /// </summary>
            /// <param name="a"></param>
            /// <param name="b"></param>
            /// <typeparam name="T"></typeparam>
            private static void Swap<T>(ref T a, ref T b)
            {
                T t = a;
                a = b;
                b = t;
            }
    
            private static void PrintArray<T>(T[] arr)
            {
                string str = typeof(T) + "[";
                if (arr.Length != 0)
                {
                    for (var i = 0; i < arr.Length - 1; i++)
                    {
                        str += arr[i] + ", ";
                    }
                    str += arr[arr.Length - 1];
                }
    
                str += "]";
                JPrint(str);
            }
    
            public static void JPrint(string obj, params object[] arg)
            {
                Console.WriteLine(obj, arg);
            }
    
            public static void JPrint(object obj)
            {
                Console.WriteLine(obj);
            }
    
            /// <summary>
            /// 获得一个int类型的值
            /// </summary>
            /// <returns></returns>
            public static int GetInt()
            {
                int i;
                while (true)
                {
                    try
                    {
                        i = Convert.ToInt32(Console.ReadLine());
                        break;
                    }
                    catch (FormatException e)
                    {
                        Console.WriteLine(e.Message);
                    }
                }
                return i;
            }
    
            public static string GetString()
            {
                return Console.ReadLine();
            }
    
            public static double GetDouble()
            {
                double i;
                while (true)
                {
                    try
                    {
                        i = Convert.ToDouble(Console.ReadLine());
                        break;
                    }
    //            catch
                    catch (FormatException e)
                    {
                        Console.WriteLine(e.Message);
                    }
                }
                return i;
            }
    
            #endregion
        }
    }
  • 相关阅读:
    【c语言】斐波那契数列
    【c语言】c语言中的问题--empty character constant
    【java 基础领域】类加载机制
    【书籍学习】汇编语言学习-第二章
    【专接本课程】c语言指针学习
    Balanced Binary Tree
    Symmetric Tree
    Same Tree
    Recover Binary Search Tree
    Binary Tree Zigzag Level Traversal
  • 原文地址:https://www.cnblogs.com/zhaoxianglong1987/p/7609395.html
Copyright © 2020-2023  润新知