Konstiga resultat av sorteringsalgoritmer

public override void Sort(int[] array)
        {
            SW1.Reset();
            SW1.Start();
            for (int i = 0; i < array.Length - 1; i++)
            {
                for (int p = i + 1; p < array.Length; p++)
                {
                    if (array[i] > array[p])
                    {
                        int temp = array[i];
                        array[i] = array[p];
                        array[p] = temp;
                    }
                }
            }
            SW1.Stop();
            TS = SW1.Elapsed;
        }

        public override void Sort(int[] array)
        {
            SW1.Reset();
            SW1.Start();

            int left = 0;

            while (left < array.Length - 1)
            {
                int value = array[left + 1];

                for (int i = 0; i <= left; i++)
                {
                    if (array[i] > value)
                    {
                        for (int p = left; p >= i; p--)
                        {
                            array[p + 1] = array[p];
                        }
                        array[i] = value;
                        break;
                    }
                }
                
                left++;
            }
            SW1.Stop();
            TS = SW1.Elapsed;
        }