text 演算法：ソート

Posted 2021-05-01

int[] numArray = {0, 4, 2, 1, 3, 5 };

            for (int i = 0; i < numArray.Length - 1; i++)
            {
                // test
                Console.WriteLine("i = " + i);

                for (int j = i + 1; j < numArray.Length; j++)
                {
                    if (numArray[i] < numArray[j])
                    {
                        // test
                        Console.WriteLine(numArray[i] < numArray[j]);

                        int partition = numArray[i];
                        numArray[i] = numArray[j];
                        numArray[j] = partition;

                        // test
                        foreach (var item in numArray)
                        {
                            Console.Write(item + ", ");
                        }
                        Console.WriteLine("\r\n---------------");
                    }
                }
            }