c#的常用排序

最新推荐文章于 2025-09-07 18:44:15 发布

转载最新推荐文章于 2025-09-07 18:44:15 发布 · 51 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/cxd4321/archive/2007/06/27/797841.html

文章标签：

#c#

class Program
    {
        static void Main(string[] args)
        {
            int[] arr ={ 23,3, 2, 5, 6, 1, 234, 4, 345, 567, 7 };

print(arr);

//QuickSort(arr,0,arr.Length-1);
selectSort(arr);

print(arr);
}

        private static void selectSort(int []arr)
        {
            for (int i = 0; i < arr.Length - 1;i++ )
            {
                for (int j = i + 1; j <=arr.Length - 1;j++ )
                {
                    if(arr[i]>arr[j])
                    {
                        int temp = arr[i];
                        arr[i] = arr[j];
                        arr[j] = temp;
                    }
                }
            }
        }

        private static void QuickSort(int[] arr,int low,int high)
        {
            if(low<high)
            {
                int pivotLoc = partialQuickSort(arr,low,high);
                QuickSort(arr,low,pivotLoc-1);
                QuickSort(arr,pivotLoc+1,high);
            }
        }

        private static int partialQuickSort(int[] arr, int low, int high)
        {
            int pivot = arr[low];
            int pivotIndex = low;
            while (low < high)
            {
                while (low < high && arr[high] >= pivot)
                {
                    high--;
                }

                int temp = arr[pivotIndex];
                arr[pivotIndex] = arr[high];
                arr[high] = temp;

pivotIndex = high;

                while (low < high && arr[low] <= pivot)
                {
                    low++;
                }

                temp = arr[pivotIndex];
                arr[pivotIndex] = arr[low];
                arr[low] = temp;

pivotIndex = low;
}

return pivotIndex;
}

        private static void BubbleSort(int []arr)
        {
            for (int i = 0; i < arr.Length-1; i++)
            {
                bool isChange = false;
                for (int j = 0; j < arr.Length - 1-i; j++)
                {
                    if (arr[j]<arr[j+1])
                    {
                        isChange = true;
                        int temp = arr[j];
                        arr[j] = arr[j + 1];
                        arr[j + 1] = temp;
                    }
                }
                if(!isChange)
                {
                    return;
                }
            }
        }

        private static void print(int []arr)
        {
            for (int i = 0; i < arr.Length; i++)
            {
                if (i != arr.Length - 1)
                {
                    Console.Write("{0,3},", arr[i].ToString().PadLeft());
                }
                else
                {
                    Console.Write("{0,3}", arr[i]);
                }
            }
            Console.WriteLine();
        }
    }