(self, arr, low, high)
| 73 | return i+1 |
| 74 | |
| 75 | def quick_sort(self, arr, low, high): |
| 76 | if low >= high: |
| 77 | return |
| 78 | p = self.partition(arr, low, high) |
| 79 | self.quick_sort(arr, low, p-1) |
| 80 | self.quick_sort(arr, p+1, high) |
| 81 | |
| 82 | def construct(self): |
| 83 | self.scale(1) |