InsertSort

static int[] InsertSort(int[] t)
        {
            int value,j;
            for (int i = 1; i < t.Length; i++)
            {
                value = t[i];
                for (j = i-1; j >= 0 && t[j] > value; j--)
                {
                    t[j + 1] = t[j];
                }

                t[j + 1] = value;
            }

            return t;
        }