private void insertion_sort()
        {
            swaps = 0;
            compares = 0;
            display();
            DateTime startTime = DateTime.Now;

            int temp = 0;
            for (int i = 1; i < nums.Length; i++)
            {
                int j = 0;
                compares++;
                while(nums[i] >= nums[j]&&i!=j)
                {
                    j++;
                    compares++;
                }
                if (i != j)
                {
                    temp = nums[i];
                    for (int k = i; k > j; k--)
                    {
                        nums[k] = nums[k - 1];
                        swaps++;
                    }
                    nums[j] = temp;
                    swaps++;
                }
                if (i % often == 0 && i != 0)
                {
                    display();
                }
            }
            DateTime endTime = DateTime.Now;
            TimeSpan the_dif = endTime - startTime;
            txt_current.AppendText(Environment.NewLine);
            display();

            txt_history.AppendText("Insertion Sort:  Compared: " + compares.ToString() + "  " + "Swapped: " + swaps.ToString() + "  " + "Numbers in array: " + nums.Length.ToString() + "  It took: " + the_dif.ToString() + Environment.NewLine);


        }