912

Author: ProHiryu

Sort/912.md

@@ -0,0 +1,28 @@
+## Sort an Array
+
+#### Description
+
+[link](https://leetcode.com/problems/sort-an-array/)
+
+---
+
+#### Solution
+
+- See Code
+
+---
+
+#### Code
+
+O(nlog(n))
+
+```python
+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)
+```