一些算法案例

將數字從小到大排列， （用pycharm中的斷點和Debugger來看程序運行的步驟）
def find_smallest(arr):
    smallest = arr[0]
    smallest_index = 0
    for i in range(1,len(arr)):
        if arr[i] < smallest:
            smallest = arr[i]
            smallest_index = i
    return  smallest_index



def selection_sort(arr):
    new_arr = []
    for i in range(len(arr)):
        smallest = find_smallest(arr)
        new_arr.append(arr.pop(smallest))
    return new_arr

print(selection_sort([8,6,4,9,2]))

 用pycharm中的斷點和Debugger來看程序運行的步驟

for i in range (1,10):                          九九乘法表 
    for j in range (1,10):
        print('{:2d}*{:2d}={:2d}'.format(i,j,i*j),end=' ')
    print()

i=1而後進入內循環，j=1到9；而後i=2再進入內循環窮舉j=1到9，直到i=9進內循環窮舉j=1到9

print函數默認換行，是end='\n'在起做用，

python默認的print()是換行輸出的

print(value, ..., sep=' ', end='\n', file=sys.stdout, flush=False)

In [8]: for i in range(1,9): print(i)
1
2
3
4
5
6
7
8

In [9]: for i in range(1,9):  print(i,end="")
12345678

In [11]: for i in range(9):    print(i,end='$$$')
0$$$1$$$2$$$3$$$4$$$5$$$6$$$7$$$8$$$

In [12]: for i in range(9):    print(i,end='\t')
0       1       2       3       4       5       6       7       8