


from statistics import mean

import numpy as np






def 		lowercase_(  SCREAMING_SNAKE_CASE_      ,						SCREAMING_SNAKE_CASE_      ,						SCREAMING_SNAKE_CASE_      ,						SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

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

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

  while no_of_process > finished_process_count:
    lowerCamelCase :					Tuple    =				0
    while finished_process[i] == 1:
      i += 1
    if current_time < arrival_time[i]:
      lowerCamelCase :					List[str]    =				arrival_time[i]

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

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

  return turn_around_time






def 		lowercase_(  SCREAMING_SNAKE_CASE_      ,						SCREAMING_SNAKE_CASE_      ,						SCREAMING_SNAKE_CASE_      ,						SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  lowerCamelCase :					Optional[int]    =				[0] * no_of_process
  for i in range(0      ,						SCREAMING_SNAKE_CASE_	):
    lowerCamelCase :					List[Any]    =				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}''')







def 		lowercase_(  SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  for i in range(len(SCREAMING_SNAKE_CASE_	) - 1      ,						0      ,						-1	):
    lowerCamelCase :					Tuple    =				False

    for j in range(SCREAMING_SNAKE_CASE_      ,						0      ,						-1	):
      if unsorted[j] < unsorted[j - 1]:
        lowerCamelCase    ,	lowerCamelCase :					int    =				unsorted[j - 1], unsorted[j]
        lowerCamelCase :					Optional[int]    =				True

    for j in range(SCREAMING_SNAKE_CASE_	):
      if unsorted[j] > unsorted[j + 1]:
        lowerCamelCase    ,	lowerCamelCase :					Union[str, Any]    =				unsorted[j + 1], unsorted[j]
        lowerCamelCase :					Optional[Any]    =				True

    if not swapped:
      break
  return unsorted


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   _snake_case             =     input('''Enter numbers separated by a comma:\n''').strip()
   _snake_case             =     [int(item) for item in user_input.split(''',''')]
   print(f'''{cocktail_shaker_sort(unsorted) = }''')



