- See Code
O(nlog(n))
class Solution:
def sortArray(self, nums: List[int]) -> List[int]:
if not nums or len(nums) == 1:
return nums
a = nums[0]
small = [n for n in nums[1:] if n <= a]
large = [n for n in nums[1:] if n > a]
return self.sortArray(small) + [a] + self.sortArray(large)