Can anyone tell me the complexity of my code, sorry i am new in cs

```
class Solution(object):
def findMedianSortedArrays(self, nums1, nums2):
whole_list = nums1 + nums2
whole_list.sort()
n = len(whole_list)
if n%2 == 0:
return(float(whole_list[n/2]+whole_list[(n/2)-1])/2)
else:
return(whole_list[divmod(n, 2)[0]])
```