learn sort,add timer

Author: renwl

sorts/bogosort.py

@@ -40,7 +40,7 @@ def isSorted(collection):
 
 if __name__ == '__main__':
     import sys
-
+    '''
     # For python 2.x and 3.x compatibility: 3.x has not raw_input builtin
     # otherwise 2.x's input builtin function is too "smart"
     if sys.version_info.major < 3:
@@ -50,4 +50,6 @@ def isSorted(collection):
 
     user_input = input_function('Enter numbers separated by a comma:\n')
     unsorted = [int(item) for item in user_input.split(',')]
+    '''
+    unsorted=list(range(10,1,-1))
     print(bogosort(unsorted))

sorts/bubble_sort.py

@@ -11,7 +11,7 @@
 """
 
 from __future__ import print_function
-
+import time
 
 def bubble_sort(collection):
     """Pure implementation of bubble sort algorithm in Python
@@ -41,6 +41,7 @@ def bubble_sort(collection):
 
 if __name__ == '__main__':
     import sys
+    '''
     # For python 2.x and 3.x compatibility: 3.x has not raw_input builtin
     # otherwise 2.x's input builtin function is too "smart"
     if sys.version_info.major < 3:
@@ -50,4 +51,9 @@ def bubble_sort(collection):
 
     user_input = input_function('Enter numbers separated by a comma:\n')
     unsorted = [int(item) for item in user_input.split(',')]
+    '''
+    tstart=time.clock()
+    unsorted=list(range(5000,1,-1))
     print(bubble_sort(unsorted))
+    tend=time.clock()
+    print("read: %f s" % (tend - tstart))

sorts/heap_sort.py

@@ -54,12 +54,18 @@ def heap_sort(unsorted):
     return unsorted
 
 if __name__ == '__main__':
-    import sys
-    if sys.version_info.major < 3:
-        input_function = raw_input
-    else:
-        input_function = input
-
-    user_input = input_function('Enter numbers separated by a comma:\n')
-    unsorted = [int(item) for item in user_input.split(',')]
-    print(heap_sort(unsorted))
+	import sys
+	import time
+	if sys.version_info.major < 3:
+	    input_function = raw_input
+	else:
+	    input_function = input
+	tstart=time.clock()
+	unsorted=list(range(150000,1,-1))
+	#print(sort(unsorted))
+	print(heap_sort(unsorted))
+	tend=time.clock()
+	print("read: %f s" % (tend - tstart))
+	#user_input = input_function('Enter numbers separated by a comma:\n')
+	#unsorted = [int(item) for item in user_input.split(',')]
+	#print(heap_sort(unsorted))

sorts/quick_sort.py

@@ -11,7 +11,7 @@
 """
 from __future__ import print_function
 from random import shuffle
-
+import time
 
 def sort(collection):
     shuffle(collection)
@@ -61,6 +61,11 @@ def quick_sort(collection):
     else:
         input_function = input
 
-    user_input = input_function('Enter numbers separated by a comma:\n')
-    unsorted = [int(item) for item in user_input.split(',')]
-    print(sort(unsorted))
+    #user_input = input_function('Enter numbers separated by a comma:\n')
+    #unsorted = [int(item) for item in user_input.split(',')]
+    tstart=time.clock()
+    unsorted=list(range(500,1,-1))
+    #print(sort(unsorted))
+    print(quick_sort(unsorted))
+    tend=time.clock()
+    print("read: %f s" % (tend - tstart))