aboutsummaryrefslogtreecommitdiff
path: root/comparison/Python/qsort-800000.py
diff options
context:
space:
mode:
authorShinya Sato <shinnya.sato@gmail.com>2022-04-28 21:47:28 +0900
committerShinya Sato <shinnya.sato@gmail.com>2022-04-28 21:47:28 +0900
commit7ea48cd96551247ecc763a5e42404ffa3464d0b0 (patch)
treefd1b63ab48d98a9243d3053522e17e31b9dc033f /comparison/Python/qsort-800000.py
parent950e2cb2184cb7ead93ba8df691a190598ed242f (diff)
parent429543c748aaf81b2a4207318eb5a05259469b21 (diff)
downloadinpla-7ea48cd96551247ecc763a5e42404ffa3464d0b0.tar.gz
inpla-7ea48cd96551247ecc763a5e42404ffa3464d0b0.zip
Merge branch 'develop'
Diffstat (limited to '')
-rw-r--r--comparison/Python/qsort-800000.py12
1 files changed, 11 insertions, 1 deletions
diff --git a/comparison/Python/qsort-800000.py b/comparison/Python/qsort-800000.py
index b58bf1c..a4a66e2 100644
--- a/comparison/Python/qsort-800000.py
+++ b/comparison/Python/qsort-800000.py
@@ -22,12 +22,22 @@ def quickSort(arr):
more = quickSort(more)
return less + pivotList + more
+
def mkRandList ( n ):
a=[]
for i in range(1,n+1):
a.insert(0, random.randint(0,10000))
return a
+
+def validation(alist):
+ for i in range(len(alist)-1):
+ if (alist[i] > alist[i+1]):
+ return False
+
+ return True
+
+
a = mkRandList(800000)
b = quickSort(a)
-#print(b)
+print(validation(b))