merge sort complete

GSAUC3 · GSAUC3 · commit cd893e4e3130 · 2021-10-16T01:27:10.000+05:30
diff --git a/algo_visualizer.py b/algo_visualizer.py
@@ -268,17 +268,23 @@ def mergesort(self,a,front,last):
                     return 
                
                while front<=mid and rj<=last:
+                    self.display(self.N,self.data,['yellow' if x==front or x==rj else 'dodgerblue' for x in range(self.N)])
+                    time.sleep(self.speed)
                     if a[front]<=a[rj]:
+                         self.display(self.N,self.data,['lime' if x==front or x==rj else 'dodgerblue' for x in range(self.N)])
+                         time.sleep(self.speed)
                          front+=1
                     else:
+                         self.display(self.N,self.data,['red' if x==front or x==rj else 'dodgerblue' for x in range(self.N)])
+                         time.sleep(self.speed)
                          temp=a[rj]
                          i=rj
                          while i!=front:
                               a[i]=a[i-1]
-                              self.display(self.N,self.data,['purple' if x==i else 'dodgerblue' for x in range(self.N)])
-                              time.sleep(self.speed)
                               i-=1
                          a[front]=temp
+                         self.display(self.N,self.data,['lime' if x==front or x==rj else 'dodgerblue' for x in range(self.N)])
+                         time.sleep(self.speed)
 
                          front+=1
                          mid+=1
@@ -300,13 +306,14 @@ def partition(self,a,i,j):
           pivot=a[i]
 
           while i<j:
-               while  i<len(a) and a[i]<= pivot :
+               while  i<len(a) and a[i]<= pivot:
                     i+=1
                while a[j]>pivot:
                     j-=1
                if i<j:
                     a[i],a[j]=a[j],a[i]
-               
+               self.display(self.N,self.data,['yellow' if x==i or x==j else "dodgerblue" for x in range(self.N)])
+               time.sleep(self.speed)
           a[j],a[l]=a[l],a[j]
           return j
 
