v0.8.2

4 files changed, 41 insertions, 6 deletions

diff --git a/comparison/Python/bsort-40000.py b/comparison/Python/bsort-40000.py
index 25ea4c7..8eeb4e5 100644
--- a/comparison/Python/bsort-40000.py
+++ b/comparison/Python/bsort-40000.py
@@ -17,8 +17,15 @@ def mkRandList(n):
     return a
 
 
-                                
+def validation(alist):
+    for i in range(len(alist)-1):
+        if (alist[i] > alist[i+1]):
+            return False
+
+    return True
+
+
+
 a=mkRandList(40000)
 bubblesort(a)
-
-#print(a)
+print(validation(a))
diff --git a/comparison/Python/isort-40000.py b/comparison/Python/isort-40000.py
index 0bfc577..c8e106b 100644
--- a/comparison/Python/isort-40000.py
+++ b/comparison/Python/isort-40000.py
@@ -17,6 +17,15 @@ def mkRandList(n):
         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(40000)
 insert_sort(a)
-#print(a)
+print(validation(a))
diff --git a/comparison/Python/msort-800000.py b/comparison/Python/msort-800000.py
index fcb89e1..c244cb4 100644
--- a/comparison/Python/msort-800000.py
+++ b/comparison/Python/msort-800000.py
@@ -50,6 +50,15 @@ def mkRandList ( n ):
         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)
 mergeSort(a)
-#print(a)
+print(validation(a))
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))