modify bubble-sort

lambdaplus · lambdaplus · commit d3eb64a7e1a7 · 2016-04-09T20:06:48.000+08:00
diff --git a/bubble-sort.py b/bubble-sort.py
@@ -3,11 +3,12 @@
 
 
 def bubble_sort(L):
- for m in range(len(L)):
- n = 0
- for n in range(len(L)):
- if L[m] < L[n]:
- L[m], L[n] = L[n], L[m]
+ if len(L) < 2:
+ return L
+ for i in range(len(L)):
+ for j in range(1, len(L)):
+ if L[j - 1] > L[j]:
+ L[j - 1], L[j] = L[j], L[j - 1]
 return L
 
 if __name__ == '__main__':
diff --git a/insert-sort.py b/insert-sort.py
@@ -1,20 +1,20 @@
-# -*-coding: utf-8 -*-
+# coding=utf-8
 from random import randrange
 
 
-def insert_srot(L):
- if len(L) <= 0:
+def insert_sort(L):
+ if len(L) < 2:
 return L
 for i in range(1, len(L)):
 tmp = L[i]
 j = i - 1
- while j >= 0 and tmp < L[j]:
+ while j >= 0 and L[j] > tmp:
 L[j + 1] = L[j]
 j -= 1
 L[j + 1] = tmp
 
 return L
 
 if __name__ == '__main__':
- L = [randrange(100) for _ in range(10)]
- print(insert_srot(L))
+ L = [randrange(1000) for _ in range(10)]
+ print(insert_sort(L))

-Original file line number
+Diff line change
 defbubble_sort(L):
 -forminrange(len(L)):
 -n=0
 -forninrange(len(L)):
 -ifL[m] <L[n]:
 -L[m], L[n] =L[n], L[m]
 +iflen(L) <2:
 +returnL
 +foriinrange(len(L)):
 +forjinrange(1, len(L)):
 +ifL[j-1] >L[j]:
 +L[j-1], L[j] =L[j], L[j-1]
 returnL
 if__name__=='__main__':
-Original file line number
+Diff line change
@@ @@ -1,20 +1,20 @@ @@
 -# -*-coding: utf-8 -*-
 +# coding=utf-8
 fromrandomimportrandrange
 -definsert_srot(L):
 -iflen(L) <=0:
 +definsert_sort(L):
 +iflen(L) <2:
 returnL
 foriinrange(1, len(L)):
 tmp=L[i]
 j=i-1
 -whilej>=0andtmp<L[j]:
 +whilej>=0andL[j]>tmp:
 L[j+1] =L[j]
 j-=1
 L[j+1] =tmp
 returnL
 if__name__=='__main__':
 -L= [randrange(100) for_inrange(10)]
 -print(insert_srot(L))
 +L= [randrange(1000) for_inrange(10)]
 +print(insert_sort(L))