【学习】类重构、通用值交换、释放内存计算时间等

namespace Test1
{
    /// <summary>
    /// 重构类
    /// </summary>
    public class Collection : CollectionBase
    {
        public void Add(object item)
        {
            InnerList.Add(item);
        }

        public void Remove(object item)
        {
            InnerList.Remove(item);
        }

        public new void Clear()
        {
            InnerList.Clear();
        }

        public new int Count()
        {
            return InnerList.Count;
        }

        public void Insert(int index, object item)
        {
            InnerList.Insert(index, item);
        }

        public void Contains(object item)
        {
            InnerList.Contains(item);
        }

        public void IndexOf(object item)
        {
            InnerList.IndexOf(item);
        }

        public void RemoveAt(int index)
        {
            InnerList.RemoveAt(index);
        }
    }

    public class Node<T>
    {
        public T data;
        public Node<T> link;

        public Node(T data, Node<T> link)
        {
            this.data = data;
            this.link = link;
        }
    }

    public class Timing
    {
        private TimeSpan duration;

        public Timing()
        {
            duration = new TimeSpan();
        }

        public void stopTime()
        {
            duration = Process.GetCurrentProcess().TotalProcessorTime;
        }

        public void startTime()
        {
            GC.Collect();
            GC.WaitForPendingFinalizers();
        }

        public TimeSpan Result()
        {
            return duration;
        }
    }

    public class CArray
    {
        private int[] arr;
        private int upper;
        private int numElements;

        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>
        /// <param name="index"></param>
        public void RemoveAt(int index)
        {
            int[] arys = new int[upper - 1];
            bool isRemove = false;
            for (int i = 0; i < arys.Length; i++)
            {

                if (isRemove)
                    arys[i] = arr[i + 1];
                else
                {
                    arys[i] = arr[i];
                    isRemove = index == i;
                }

            }
            arr = new int[arys.Length];
            arr = arys;
            numElements = upper = arys.Length - 1;
        }
        /// <summary>
        /// 显示所有元素
        /// </summary>
        public void ShowElements()
        {
            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 i = 0; i <= upper; i++)
            {
                for (int j = 0; j <= upper - 1 - i; j++)
                {
                    if (arr[j] > arr[j + 1])
                    {
                        temp = arr[j];
                        arr[j] = arr[j + 1];
                        arr[j + 1] = temp;
                    }
                }
                //this.ShowElements();
            }
        }
        /// <summary>
        /// 选择排序
        /// </summary>
        public void SelectionSort()
        {
            int min, temp;
            for (int i = 0; i <= upper; i++)
            {
                min = i;
                for (int j = i + 1; j <= upper; j++)
                {
                    if (arr[j] < arr[min]) min = j;
                }
                temp = arr[i];
                arr[i] = arr[min];
                arr[min] = temp;
                //this.ShowElements();
            }
        }
        /// <summary>
        /// 插入排序
        /// </summary>
        public void InsertionSort()
        {
            int j, temp;
            for (int i = 1; i <= upper; i++)
            {
                temp = arr[i];
                j = i;
                while (j > 0 && arr[j - 1] >= temp)
                {
                    arr[j] = arr[j - 1];
                    j -= 1;
                }
                arr[j] = temp;
                //this.ShowElements();
            }
        }

        public int binSearch(int value)
        {
            int upperBound, lowerBound, mid;
            upperBound = arr.Length - 1;
            lowerBound = 0;
            while (lowerBound <= upperBound)
            {
                mid = (upperBound + lowerBound) / 2;
                if (arr[mid] == value)
                    return mid;
                if (value < arr[mid])
                    upperBound = mid - 1;
                else
                    lowerBound = mid + 1;
            }
            return -1;
        }
    }

    public class CStack
    {
        private int p_index;
        private ArrayList list;

        public CStack()
        {
            list = new ArrayList();
            p_index = -1;
        }

        public int Count
        {
            get { return list.Count; }
        }

        public void Push(object item)
        {
            list.Add(item);
            p_index++;
        }

        public object Pop()
        {
            object obj = list[p_index];
            list.RemoveAt(p_index);
            p_index--;
            return obj;
        }

        public void Clear()
        {
            list.Clear();
            p_index = -1;
        }

        public object Peek()
        {
            return list[p_index];
        }
    }
    /// <summary>
    /// 桶式散列法
    /// </summary>
    public class BucketHash
    {
        private const int size = 101;
        private ArrayList[] data;

        public BucketHash()
        {
            data = new ArrayList[size];
            for (int i = 0; i < size - 1; i++)
            {
                data[i] = new ArrayList(4);
            }
        }

        public int Hash(string s)
        {
            long tot = 0;
            char[] charray;
            charray = s.ToCharArray();
            for (int i = 0; i < s.Length - 1; i++)
            {
                tot += 37 * tot + (int)charray[i];
            }
            tot = tot % data.GetUpperBound(0);
            if (tot < 0)
                tot += data.GetUpperBound(0);
            return (int)tot;
        }

        public void Insert(string item)
        {
            int hash_val;
            hash_val = Hash(item);
            if (data[hash_val].Contains(item))
                data[hash_val].Add(item);
        }

        public void Remove(string item)
        {
            int hash_val;
            hash_val = Hash(item);
            if (data[hash_val].Contains(item))
                data[hash_val].Remove(item);
        }
    }

    class Program
    {
        private static void Swap<T>(ref T val1, ref T val2)
        {
            T temp;
            temp = val1;
            val1 = val2;
            val2 = temp;
        }

        private static long iterFib(int n)
        {
            int[] val = new int[n];
            if (n == 1 || n == 2)
            {
                return 1;
            }
            val[1] = 1;
            val[2] = 1;
            for (int i = 3; i < n; i++)
            {
                val[i] = val[i - 1] + val[i - 2];
            }
            return val[n - 1];
        }

        static void Main(string[] args)
        {
            #region 实现类重构
            //Collection names = new Collection();
            //names.Add("1");
            //names.Add("2");
            //names.Add("3");
            //names.Add("4");
            //foreach (var item in names)
            //{
            //    Console.WriteLine(item);
            //}
            //names.Remove("1");
            //Console.WriteLine(names.Count());
            //names.Clear();
            //Console.WriteLine(names.Count()); 
            #endregion

            #region 通用值交换
            //int num1 = 100;
            //int num2 = 200;
            //Console.WriteLine("num1: " + num1);
            //Console.WriteLine("num2: " + num2);
            //Swap(ref num1, ref num2);
            //Console.WriteLine("num1: " + num1);
            //Console.WriteLine("num2: " + num2);
            //string str1 = "string1";
            //string str2 = "string2";
            //Console.WriteLine("str1: " + str1);
            //Console.WriteLine("str2: " + str2);
            //Swap(ref str1, ref str2);
            //Console.WriteLine("str1: " + str1);
            //Console.WriteLine("str2: " + str2);

            //Node<string> node1 = new Node<string>("string1", null);
            //Node<string> node2 = new Node<string>("string2", node1);
            //Console.WriteLine(node1.data);
            //Console.WriteLine(node2.data);
            //Swap(ref node1, ref node2);
            //Console.WriteLine(node1.data);
            //Console.WriteLine(node2.data);
            #endregion

            #region 释放内存计算运行时间
            //int[] nums = new int[100000];
            //BuildArray(nums);
            //Timing tObj = new Timing();
            //tObj.startTime();
            //DisplayNums(nums);
            //tObj.stopTime();
            //Console.WriteLine("time:" + tObj.Result().TotalSeconds);
            #endregion

            #region 仿Array
            //CArray nums = new CArray(50);
            //for (int i = 0; i <= 49; i++)
            //{
            //    nums.Insert(i);
            //}
            //nums.ShowElements();
            //nums.RemoveAt(10);
            //nums.ShowElements();

            ////执行顺序会影响时间
            //int size = 10000;
            //CArray nums1 = new CArray(size);
            //Random rnd = new Random(100);
            //Timing tObj = new Timing();
            //for (int i = 0; i < size; i++)
            //{
            //    nums1.Insert(rnd.Next() * 100);
            //};
            //Console.WriteLine("排序前：");
            ////nums3.ShowElements();
            //Console.WriteLine("选择排序情况:");
            //tObj.startTime();
            //nums1.SelectionSort();
            //tObj.stopTime();
            //Console.WriteLine("time:" + tObj.Result().TotalSeconds);
            //Console.WriteLine("排序后：");
            //nums1.Clear();
            ////nums3.ShowElements();

            //for (int i = 0; i < size; i++)
            //{
            //    nums1.Insert(rnd.Next() * 100);
            //};
            //Console.WriteLine("排序前：");
            ////nums1.ShowElements();
            //Console.WriteLine("插入排序情况:");

            //tObj.startTime();
            //nums1.InsertionSort();
            //tObj.stopTime();
            //Console.WriteLine("time:" + tObj.Result().TotalSeconds);
            //nums1.Clear();
            //Console.WriteLine("排序后：");
            ////nums1.ShowElements();

            //for (int i = 0; i < size; i++)
            //{
            //    nums1.Insert(rnd.Next() * 100);
            //};
            //Console.WriteLine("排序前：");
            ////nums2.ShowElements();
            //Console.WriteLine("冒泡排序情况:");
            //tObj.startTime();
            //nums1.BubbleSort();
            //tObj.stopTime();
            //Console.WriteLine("time:" + tObj.Result().TotalSeconds);
            //nums1.Clear();
            //Console.WriteLine("排序后：");
            ////num1.ShowElements();

            //Timing sortTime = new Timing();
            //Random rnd = new Random(100);
            //int numItems = 10000;
            //CArray theArray = new CArray(numItems);
            //for (int i = 0; i < numItems; i++)
            //    theArray.Insert(rnd.Next() * 100);
            //sortTime.startTime();
            //theArray.SelectionSort();
            //sortTime.stopTime();
            //Console.WriteLine("Time for Selection sort: " + sortTime.Result().TotalMilliseconds);
            //theArray.Clear();
            //for (int i = 0; i < numItems; i++)
            //    theArray.Insert(rnd.Next() * 100);
            //sortTime.startTime();
            //theArray.BubbleSort();
            //sortTime.stopTime();
            //Console.WriteLine("Time for Bubble sort: " + sortTime.Result().TotalMilliseconds);
            //theArray.Clear();
            //for (int i = 0; i < numItems; i++)
            //    theArray.Insert(rnd.Next() * 100);
            //sortTime.startTime();
            //theArray.InsertionSort();
            //sortTime.stopTime();
            //Console.WriteLine("Time for Insertion sort: " + sortTime.Result().TotalMilliseconds);
            #endregion

            #region 基础查找算法
            //Random random = new Random();
            //CArray mynums = new CArray(910);
            //for (int i = 0; i <= 9; i++)
            //    mynums.Insert(random.Next(100));
            //mynums.BubbleSort();
            //mynums.ShowElements();
            //int position = mynums.binSearch(77);
            //if (position >= -1)
            //{
            //    Console.WriteLine("found item");
            //    mynums.ShowElements();
            //}
            //else
            //    Console.WriteLine("Not in the array");
            //Console.Read();
            #endregion

            #region 仿Stack
            //CStack alist = new CStack();
            //string ch;
            //string word = "sees";
            //bool isPalindrome = true;
            //for (int x = 0; x < word.Length; x++)
            //    alist.Push(word.Substring(x, 1));
            //int pos = 0;
            //while (alist.Count > 0)
            //{
            //    ch = alist.Pop().ToString();
            //    if (ch != word.Substring(pos, 1))
            //    {
            //        isPalindrome = false;
            //        break;
            //    }
            //    pos++;
            //}
            //if (isPalindrome)
            //    Console.WriteLine(word + " is a palindrome.");
            //else
            //    Console.WriteLine(word + " is not a palindrome.");
            //Console.Read();
            #endregion

            #region 斐波那契数列
            //Console.WriteLine(iterFib(35));
            #endregion

        }



        private static void BuildArray(int[] arr)
        {
            for (int i = 0; i < arr.Length; i++)
            {
                arr[i] = i;
            }
        }

        private static void DisplayNums(int[] arr)
        {
            for (int i = 0; i <= arr.GetUpperBound(0); i++)
            {
                Console.WriteLine(arr[i] + " ");
            }
        }
    }
}