code: 
  
  
  """simple docstring"""
  
  
  
  
  def 			a_   (  lowercase__   :list[int]    ):
  			# base case
  			if len(lowercase__    ) == 1:
  						return a[0], a[0]
  			else:
  						# split A into half.
  						__lowerCamelCase        =			a[: len(lowercase__    ) // 2]
  						__lowerCamelCase        =			a[len(lowercase__    ) // 2 :]
  
  						# 2 sub problems, 1/2 of original size.
  						__lowerCamelCase    ,__lowerCamelCase        =			max_difference(lowercase__    )
  						__lowerCamelCase    ,__lowerCamelCase        =			max_difference(lowercase__    )
  
  						# get min of first and max of second
  						# linear time
  						__lowerCamelCase        =			min(lowercase__    )
  						__lowerCamelCase        =			max(lowercase__    )
  
  						# 3 cases, either (small1, big1),
  						# (min_first, max_second), (small2, big2)
  						# constant comparisons
  						if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
  									return smalla, biga
  						elif biga - smalla > max_second - min_first:
  									return smalla, biga
  						else:
  									return min_first, max_second
  
  
  if __name__ == "__main__":
  					import doctest
  
  					doctest.testmod()
  
  
  
  
  
style_context: 
  
  
  """simple docstring"""
  
  
  
  
  import numpy as np
  
  
  
  
  
  def 			a_   (  lowercase__   :List[str]    ):
  			__lowerCamelCase        =			np.exp(lowercase__    )
  
  			# Add up the all the exponentials
  			__lowerCamelCase        =			np.sum(lowercase__    )
  
  			# Divide every exponent by the sum of all exponents
  			__lowerCamelCase        =			exponent_vector / sum_of_exponents
  
  			return softmax_vector
  
  
  if __name__ == "__main__":
  					print(softmax((0,)))
  
  
  
  
  