C#算法基础之冒泡排序

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsolePractice
{
    class CArray
    {
        private int[] arr;
        //数组大小
        private int upper;
        //下标
        private int numElements;
        
        /// <summary>
        /// 初始化数组参数
        /// </summary>
        /// <param name="size"></param>
        public CArray(int size)
        {
            arr = new int[size];
            upper = size - 1;
            numElements = 0;
        }

        /// <summary>
        /// 插入方法
        /// </summary>
        /// <param name="item">存储的数</param>
        public void Insert(int item)
        {
            arr[numElements] = item;
            numElements++;
        }

        /// <summary>
        /// 输出方法
        /// </summary>
        public void DisplayElements()
        {
            for (int i = 0; i <= upper; i++)
            {
                Console.Write(arr[i] + " ");
            }
            Console.WriteLine();
        }

        /// <summary>
        /// 清除数组
        /// </summary>
        public void Clear()
        {
            for (int i = 0; i <= upper; i++)
            {
                arr[i] = 0;
            }
            numElements = 0;
        }

        /// <summary>
        /// 冒泡排序算法
        /// </summary>
        public void BubbleSort()
        {
            int temp;
            for (int outer = upper; outer >= 1; outer--)
            {
                //每一轮最后的一个数值可以确定，所以每一轮都减少1次。按照outer判定。
                for (int inner = 0; inner <= outer - 1; inner++)
                {
                    if (arr[inner] > arr[inner + 1])
                    {
                        temp = arr[inner];
                        arr[inner] = arr[inner + 1];
                        arr[inner + 1] = temp;
                    }
                }
                this.DisplayElements();
            }
        }
    }

    class C_shape
    {
        static void Main()
        {
            CArray nums = new CArray(10);
            Random rnd = new Random(100);
            for (int i = 0; i < 10; i++)
            {
                nums.Insert(rnd.Next(0,100));
            }
            Console.WriteLine("Before sorting:");
            nums.DisplayElements();
            Console.WriteLine("During sorting:");
            nums.BubbleSort();
            Console.WriteLine("After sorting:");
            nums.DisplayElements();
            Console.ReadKey();
        }
    }
}

 运行结果：