Implement a function to find the median of two sorted arrays of different sizes with O(1) space complexity and O(n) time complexity.

Here ' s one way to implement a function to find the median of two sorted arrays of different sizes with O ( 1 ) space complexity and O ( n ) time complexity : \n ``` \n def find _ med ian _ sorted _ array s ( arr 1 , arr 2 ): \n n = max ( len ( arr 1 ), len ( arr 2 )) \n mid = n // 2 \n \n if len ( arr 1 ) <</a> mid : \n return arr 1 [ 0 ] \n elif len ( arr 2 ) <</a> mid : \n return arr 2 [ 0 ] \n else : \n return ( arr 1 [ mid ] + arr 2 [ mid ]) / 2 \n ``` \n This function takes two sorted arrays , ` arr 1 ` and ` arr 2 `, and returns the median of the two arrays . It does this by first determ ining the size of the larger array , ` n `, and then finding the middle index of ` n `. If the first array has fewer elements than the middle index , it returns the first element of the first array . If the second array has fewer elements than the middle index , it returns the first element of the second array . Otherwise , it returns the average of the middle element of the two arrays . \n \n This function has O ( 1 ) space complexity because it only uses the size of the arrays to determine the middle index , and it does not allocate any additional memory . The time complexity of this function is O ( n ) because it needs to iterate over both arrays to find the middle index and determine which element to return . </s>