Merge Sort Python3
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def sortArray(self, nums: List[int]) -> List[int]:\n        def merge(nums):\n            if len(nums)>1:\n                mid=len(nums)//2\n                left_list=nums[:mid]\n                right_list=nums[mid:]\n                merge(left_list)\n                merge(right_list)\n                a,b,c=0,0,0\n                while a<len(left_list) and b<len(right_list):\n                    if left_list[a]<right_list[b]:\n                        nums[c]=left_list[a]\n                        a+=1\n                        c+=1\n                    else:\n                        nums[c]=right_list[b]\n                        b+=1\n                        c+=1\n                while a<len(left_list):\n                    nums[c]=left_list[a]\n                    a+=1\n                    c+=1\n                while b<len(right_list):\n                    nums[c]=right_list[b]\n                    b+=1\n                    c+=1\n        merge(nums)\n        return nums\n        #----->kindly upvote me if it\'s helpful \n```
['Python3']