内容:很水,但很真实。
'''选择排序'''
a=[]
for i in range(len(b)):
a.append(min(b))
b.remove(min(b))
print(a)
please enter any numbers : q or Q quit:45678
please enter any numbers : q or Q quit:345
please enter any numbers : q or Q quit:345
please enter any numbers : q or Q quit:9765
please enter any numbers : q or Q quit:6789
please enter any numbers : q or Q quit:09876
please enter any numbers : q or Q quit:-0987
please enter any numbers : q or Q quit:4567
please enter any numbers : q or Q quit:678
please enter any numbers : q or Q quit:2345678
please enter any numbers : q or Q quit:8790
please enter any numbers : q or Q quit:q
[45678, 345, 345, 9765, 6789, 9876, -987, 4567, 678, 2345678, 8790]
[-987, 345, 345, 678, 4567, 6789, 8790, 9765, 9876, 45678, 2345678]
总结:
很水,但,问题不大,最近有亿点点忙,刚刚花了亿点点时间在想排序的第三种方法,根本不是很会,思路有就是list它怎么插入哇!!!太难了。