#常見的冒泡排序法,如[7,2,5,1,4]
當 i = 0 ,進入第二個for , 循環次數5-0-1=4次,當j = 0 [2,7,5,1,4]
j = 1 [2,5,7,1,4]
j = 2 [2,5,1,7,4]
j = 3 [2,5,1,4,7]
當 i = 1 ,進入第二個for , 循環次數5-1-1=3次, 當j = 0 [2,5,1,4,7]
j = 1 [2,1,5,4,7]
j = 2 [2,1,4,5,7]
當 i = 2 ,進入第二個for , 循環次數5-2-1=2次, 當j = 0 [1,2,4,5,7]
j = 1 [1,2,4,5,7]
當 i = 3 ,進入第二個for , 循環次數5-3-1=1次, 當j = 0 [1,2,4,5,7]