daviddoji/Sorting-Algorithms-Blender
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update QuickSort.py

Browse Source
This commit is contained in:
ForeignGods
2022-06-01 15:17:36 +02:00
parent 06dc12607d
commit 469cf8421b
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
QuickSort.py
View File

@@ -110,12 +110,7 @@ def partition(array, low, high):
i = low i = low
j = high j = high
while True: while True:
iframe += 1
for cube in cubes:
cube.keyframe_insert(data_path="location", frame=iframe)
while array[i].scale.z < pivot.scale.z: while array[i].scale.z < pivot.scale.z:
#add 1 to comparison counter #add 1 to comparison counter
@@ -133,6 +128,11 @@ def partition(array, low, high):
if i >= j: if i >= j:
return j return j
else:
iframe += 1
for cube in cubes:
cube.keyframe_insert(data_path="location", frame=iframe)
array[i].location.x = j array[i].location.x = j
array[j].location.x = i array[j].location.x = i