https://leetcode-cn.com/submissions/detail/24124350/
class Solution(object):
def sortArray(self, nums):
# ------------------------------------------------------------------------
def partition(data, low, high): # partition时间复杂度: --O(n)
i, j = low, high
base = data[low] # base的选择对划分会有影响,有序时最坏O(n^2),斜树
while i < j: #选择与基准相反的方向开始