


'''simple docstring'''
from statistics import mean

import numpy as np


def     a   (    __a				,      __a				,      __a				,      __a     )						->			list:



					'''simple docstring'''






					UpperCamelCase__     :List[str]							      =				0
					# Number of processes finished
					UpperCamelCase__     :str							      =				0
					# Displays the finished process.
					# If it is 0, the performance is completed if it is 1, before the performance.
					UpperCamelCase__     :Tuple							      =				[0] * no_of_process
					# List to include calculation results
					UpperCamelCase__     :Tuple							      =				[0] * no_of_process

					# Sort by arrival time.
					UpperCamelCase__     :Any							      =				[burst_time[i] for i in np.argsort(__a     )]
					UpperCamelCase__     :Union[str, Any]							      =				[process_name[i] for i in np.argsort(__a     )]
					arrival_time.sort()

					while no_of_process > finished_process_count:
										UpperCamelCase__     :List[Any]							      =				0
										while finished_process[i] == 1:
															i += 1
										if current_time < arrival_time[i]:
															UpperCamelCase__     :Optional[int]							      =				arrival_time[i]

										UpperCamelCase__     :Dict							      =				0
										# Index showing the location of the process being performed
										UpperCamelCase__     :Dict							      =				0
										# Saves the current response ratio.
										UpperCamelCase__     :Any							      =				0
										for i in range(0				,      __a     ):
															if finished_process[i] == 0 and arrival_time[i] <= current_time:
																				UpperCamelCase__     :Tuple							      =				(burst_time[i] + (current_time - arrival_time[i])) / burst_time[
																				    i
																				]
															if response_ratio < temp:
																				UpperCamelCase__     :int							      =				temp
																				UpperCamelCase__     :int							      =				i

        # Calculate the turn around time
										UpperCamelCase__     :Union[str, Any]							      =				current_time + burst_time[loc] - arrival_time[loc]
										current_time += burst_time[loc]
										# Indicates that the process has been performed.
										UpperCamelCase__     :List[Any]							      =				1
										# Increase finished_process_count by 1
										finished_process_count += 1

					return turn_around_time


def     a   (    __a				,      __a				,      __a				,      __a     )						->			list:



					'''simple docstring'''






					UpperCamelCase__     :Optional[Any]							      =				[0] * no_of_process
					for i in range(0				,      __a     ):
										UpperCamelCase__     :Tuple							      =				turn_around_time[i] - burst_time[i]
					return waiting_time


if __name__ == "__main__":
						__snake_case							   =  5
						__snake_case							   =  ['''A''', '''B''', '''C''', '''D''', '''E''']
						__snake_case							   =  [1, 2, 3, 4, 5]
						__snake_case							   =  [1, 2, 3, 4, 5]

						__snake_case							   =  calculate_turn_around_time(
						    process_name, arrival_time, burst_time, no_of_process
						)
						__snake_case							   =  calculate_waiting_time(
						    process_name, turn_around_time, burst_time, no_of_process
						)

						print('''Process name \tArrival time \tBurst time \tTurn around time \tWaiting time''')
						for i in range(0, no_of_process):
												print(
												    F"""{process_name[i]}\t\t{arrival_time[i]}\t\t{burst_time[i]}\t\t"""
												    F"""{turn_around_time[i]}\t\t\t{waiting_time[i]}"""
												)

						print(F"""average waiting time : {mean(waiting_time):.5f}""")
						print(F"""average turn around time : {mean(turn_around_time):.5f}""")



'''simple docstring'''
import numpy as np


def     a   (    __a				,      __a				,      __a				,      __a				,      __a     )						->			Union[str, Any]:



					'''simple docstring'''






					UpperCamelCase__     :Tuple							      =				int(np.ceil((x_end - xa) / h     )     )
					UpperCamelCase__     :Optional[int]							      =				np.zeros((n + 1,)     )
					UpperCamelCase__     :List[str]							      =				ya
					UpperCamelCase__     :Tuple							      =				xa

					for k in range(__a     ):
										UpperCamelCase__     :Dict							      =				f(__a				,      y[k]     )
										UpperCamelCase__     :List[Any]							      =				f(x + 0.5 * h				,      y[k] + 0.5 * h * ka     )
										UpperCamelCase__     :Dict							      =				f(x + 0.5 * h				,      y[k] + 0.5 * h * ka     )
										UpperCamelCase__     :List[Any]							      =				f(x + h				,      y[k] + h * ka     )
										UpperCamelCase__     :List[str]							      =				y[k] + (1 / 6) * h * (ka + 2 * ka + 2 * ka + ka)
										x += h

					return y


if __name__ == "__main__":
		import doctest

		doctest.testmod()