



def 						_UpperCAmelCase							( snake_case     ):





					"""simple docstring"""

					if len(snake_case     ) == 1:
										return a[0], a[0]
					else:
										# split A into half.
										_lowerCAmelCase         =       a[: len(snake_case     ) // 2]
										_lowerCAmelCase         =       a[len(snake_case     ) // 2 :]

										# 2 sub problems, 1/2 of original size.
										_lowerCAmelCase      ,      _lowerCAmelCase         =       max_difference(snake_case     )
										_lowerCAmelCase      ,      _lowerCAmelCase         =       max_difference(snake_case     )

										# get min of first and max of second
										# linear time
										_lowerCAmelCase         =       min(snake_case     )
										_lowerCAmelCase         =       max(snake_case     )

										# 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()






from __future__ import annotations


def        _UpperCAmelCase							(	_SCREAMING_SNAKE_CASE       :		list[int]							):





    """simple docstring"""


    SCREAMING_SNAKE_CASE_						=    [0] * len(_SCREAMING_SNAKE_CASE							)
    for i in range(1			, len(_SCREAMING_SNAKE_CASE							)							):
        SCREAMING_SNAKE_CASE_						=    duration_times[i - 1] + waiting_times[i - 1]
    return waiting_times


def        _UpperCAmelCase							(	_SCREAMING_SNAKE_CASE       :		list[int]			, _SCREAMING_SNAKE_CASE       :		list[int]							):





    """simple docstring"""


    return [
        duration_time + waiting_times[i]
        for i, duration_time in enumerate(_SCREAMING_SNAKE_CASE							)
    ]


def        _UpperCAmelCase							(	_SCREAMING_SNAKE_CASE       :		list[int]							):





    """simple docstring"""


    return sum(_SCREAMING_SNAKE_CASE							) / len(_SCREAMING_SNAKE_CASE							)


def        _UpperCAmelCase							(	_SCREAMING_SNAKE_CASE       :		list[int]							):





    """simple docstring"""


    return sum(_SCREAMING_SNAKE_CASE							) / len(_SCREAMING_SNAKE_CASE							)


if __name__ == "__main__":
       # process id's
       UpperCamelCase__	:   List[str]								=     [1, 2, 3]

       # ensure that we actually have processes
       if len(processes) == 0:
              print("Zero amount of processes")
              raise SystemExit(0)

       # duration time of all processes
       UpperCamelCase__	:   Any								=     [19, 8, 9]

       # ensure we can match each id to a duration time
       if len(duration_times) != len(processes):
              print("Unable to match all id's with their duration time")
              raise SystemExit(0)

       # get the waiting times and the turnaround times
       UpperCamelCase__	:   List[str]								=     calculate_waiting_times(duration_times)
       UpperCamelCase__	:   Union[str, Any]								=     calculate_turnaround_times(duration_times, waiting_times)

       # get the average times
       UpperCamelCase__	:   str								=     calculate_average_waiting_time(waiting_times)
       UpperCamelCase__	:   List[Any]								=     calculate_average_turnaround_time(turnaround_times)

       # print all the results
       print("Process ID\tDuration Time\tWaiting Time\tTurnaround Time")
       for i, process in enumerate(processes):
              print(
                  F'{process}\t\t{duration_times[i]}\t\t{waiting_times[i]}\t\t'
                  F'{turnaround_times[i]}'
              )
       print(F'Average waiting time = {average_waiting_time}')
       print(F'Average turn around time = {average_turnaround_time}')


