算法-排序

1、冒泡排序

namespace 冒泡排序
{
    internal class Program
    {
        static void Main(string[] args)
        {
            //自己写的冒泡排序
            int[] arr = {3, 43, 12, 51, 11, 11, 21, 1};
            int temp;
            for (int j = 0; j < arr.Length - 1; j++)
            {
                for (int i = 0; i < arr.Length - 1 - j; i++)
                {
                    if (arr[i] > arr[i + 1])
                    {
                        temp = arr[i + 1];
                        arr[i + 1] = arr[i];
                        arr[i] = temp;
                    }
                }
            }
            
            for (int i = 0; i < arr.Length; i++)
            {
                Console.WriteLine(arr[i]);
            }
        }
    }
}

 2、选择排序

#region 选择排序
int[] arr1 = { 3, 43, 12, 51, 11, 11, 21, 1 };
int index;
int temp1;
for(int i = 0; i < arr1.Length - 1; i++)
{
    index = 0;
    int len = arr1.Length - 1 - i;
    for(int j = 0; j < len; j++)
    {
        if(arr1[index] < arr1[j])
        {
            index = j;
        }
    }
    temp = arr1[len];
    arr1[len] = arr1[index];
    arr1[index] = temp;
}
Console.WriteLine("选择排序:");
for (int i = 0; i < arr.Length; i++)
{
    Console.Write(arr[i] + " ");
}
#endregion