(shuffledList)
| 123 | # 快排的思路是，选取一个元素，将大于它的放在左边，小于的放在右边。然后将左边右边再次进行相同的操作。 |
| 124 | |
| 125 | def fastSort(shuffledList): |
| 126 | if len(shuffledList) <= 1: |
| 127 | return shuffledList |
| 128 | |
| 129 | right = [i for i in shuffledList[1:] if i < shuffledList[0]] |
| 130 | left = [i for i in shuffledList[1:] if i >= shuffledList[0]] |
| 131 | |
| 132 | return fastSort(right) + [shuffledList[0]] + fastSort(left) |
| 133 | |
| 134 | |
| 135 | for i, j in zip(test_list, result): |