冒泡排序法

int[] arr = new int[]{ 1,5,3,9,13,11,7,21};
            foreach (int m in arr)
                Console.Write(m+" ");
            Console.WriteLine();
            int j, temp;
            for(int i=0;i<arr.Length-1;i++)
            {
                j = i + 1;
            id:
                if (arr[i] > arr[j])
                {
                    temp = arr[i];
                    arr[i]=arr[j];
                    arr[j]=temp;
                    goto id;

                }
                else
                    if (j < arr.Length-1)
                    {
                        j++;
                        goto id;
                    }
               

            }
            foreach (int n in arr)
                Console.Write(n + " ");
            Console.WriteLine();