





"""simple docstring"""
def      __lowerCamelCase   (							a_     :		list							)			->      float:
      __SCREAMING_SNAKE_CASE   :Optional[Any]						=  0
      while len(a_							) > 1:
            __SCREAMING_SNAKE_CASE   :List[str]						=  0
            # Consider two files with minimum cost to be merged
            for _ in range(2							):
                  __SCREAMING_SNAKE_CASE   :Optional[int]						=  files.index(min(a_							)							)
                  temp += files[min_index]
                  files.pop(a_							)
            files.append(a_							)
            optimal_merge_cost += temp
      return optimal_merge_cost


if __name__ == "__main__":
  import doctest

  doctest.testmod()






"""simple docstring"""
from collections.abc import Callable

import numpy as np



def      __lowerCamelCase   (							a_     :		Callable ,   a_     :		float ,   a_     :		float ,   a_     :		float ,   a_     :		float							)			->      np.ndarray:
      __SCREAMING_SNAKE_CASE   :List[Any]						=  int(np.ceil((x_end - xa) / step_size							)							)
      __SCREAMING_SNAKE_CASE   :Optional[Any]						=  np.zeros((n + 1,)							)
      __SCREAMING_SNAKE_CASE   :int						=  ya
      __SCREAMING_SNAKE_CASE   :str						=  xa

      for k in range(a_							):
            __SCREAMING_SNAKE_CASE   :Optional[int]						=  y[k] + step_size * ode_func(a_ ,   y[k]							)
            x += step_size

      return y


if __name__ == "__main__":
  import doctest

  doctest.testmod()