✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)CodeTime complexity: O(n∗log(n)). Space complexity:
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)

# Code
Time complexity: $$O(n*log(n))$$. Space complexity: $$O(n)$$.
```python3
class Solution:
    def sortArray(self, a: List[int]) -> List[int]:
        return (f:=lambda a:len(a)==1 and a or merge(f(a[:(m:=len(a)//2)]),f(a[m:])))(a)
```

(Disclaimer 2: code above is just a product of fantasy packed into one line, it is not claimed to be 'true' oneliners - please, remind about drawbacks only if you know how to make it better)
['Array', 'Divide and Conquer', 'Sorting', 'Merge Sort', 'Python', 'Python3']