


from __future__ import annotations

from statistics import mean






def 							_lowerCAmelCase (  _a   :					list[int]					,   _a   :					list[int]					,   _a   :					int			)	->			list[int]:
     lowerCAmelCase_					:       int    =		[0] * no_of_processes
     lowerCAmelCase_					:       int    =		[0] * no_of_processes

     # Initialize remaining_time to waiting_time.

     for i in range(_a			):
          lowerCAmelCase_					:       Dict    =		burst_time[i]
     lowerCAmelCase_					:       list[int]    =		[]

     lowerCAmelCase_					:       Tuple    =		0
     lowerCAmelCase_					:       Union[str, Any]    =		0

     # When processes are not completed,
     # A process whose arrival time has passed \
     # and has remaining execution time is put into the ready_process.
     # The shortest process in the ready_process, target_process is executed.

     while completed != no_of_processes:
          lowerCAmelCase_					:       List[str]    =		[]
          lowerCAmelCase_					:       Optional[int]    =		-1

          for i in range(_a			):
               if (arrival_time[i] <= total_time) and (remaining_time[i] > 0):
                    ready_process.append(_a			)

          if len(_a			) > 0:
               lowerCAmelCase_					:       List[str]    =		ready_process[0]
               for i in ready_process:
                    if remaining_time[i] < remaining_time[target_process]:
                         lowerCAmelCase_					:       Tuple    =		i
               total_time += burst_time[target_process]
               completed += 1
               lowerCAmelCase_					:       Optional[Any]    =		0
               lowerCAmelCase_					:       Optional[Any]    =		(
                   total_time - arrival_time[target_process] - burst_time[target_process]
               )
          else:
               total_time += 1

     return waiting_time






def 							_lowerCAmelCase (  _a   :					list[int]					,   _a   :					int					,   _a   :					list[int]			)	->			list[int]:
     lowerCAmelCase_					:       Tuple    =		[0] * no_of_processes
     for i in range(_a			):
          lowerCAmelCase_					:       str    =		burst_time[i] + waiting_time[i]
     return turn_around_time


if __name__ == "__main__":
      print("""[TEST CASE 01]""")

      UpperCAmelCase_					:   List[Any] 							=						4
      UpperCAmelCase_					:   Any 							=						[2, 5, 3, 7]
      UpperCAmelCase_					:   Tuple 							=						[0, 0, 0, 0]
      UpperCAmelCase_					:   Tuple 							=						calculate_waitingtime(arrival_time, burst_time, no_of_processes)
      UpperCAmelCase_					:   Optional[int] 							=						calculate_turnaroundtime(
          burst_time, no_of_processes, waiting_time
      )

      # Printing the Result
      print("""PID\tBurst Time\tArrival Time\tWaiting Time\tTurnaround Time""")
      for i, process_id in enumerate(list(range(1, 5))):
            print(
                F"""{process_id}\t{burst_time[i]}\t\t\t{arrival_time[i]}\t\t\t\t"""
                F"""{waiting_time[i]}\t\t\t\t{turn_around_time[i]}"""
            )
      print(F"""\nAverage waiting time = {mean(waiting_time):.5f}""")
      print(F"""Average turnaround time = {mean(turn_around_time):.5f}""")







from __future__ import annotations






def 							_lowerCAmelCase (  _a   :					list[int]			)	->			list[int]:  # This function is recursive
     lowerCAmelCase_					:       List[Any]    =		len(_a			)
     # If the array contains only one element, we return it (it's the stop condition of
     # recursion)
     if array_length <= 1:
          return array
          # Else
     lowerCAmelCase_					:       Union[str, Any]    =		array[0]
     lowerCAmelCase_					:       str    =		False
     lowerCAmelCase_					:       Optional[int]    =		1
     lowerCAmelCase_					:       list[int]    =		[]
     while not is_found and i < array_length:
          if array[i] < pivot:
               lowerCAmelCase_					:       Optional[Any]    =		True
               lowerCAmelCase_					:       Tuple    =		[element for element in array[i:] if element >= array[i]]
               lowerCAmelCase_					:       Any    =		longest_subsequence(_a			)
               if len(_a			) > len(_a			):
                    lowerCAmelCase_					:       List[Any]    =		temp_array
          else:
               i += 1

     lowerCAmelCase_					:       Tuple    =		[element for element in array[1:] if element >= pivot]
     lowerCAmelCase_					:       List[Any]    =		[pivot, *longest_subsequence(_a			)]
     if len(_a			) > len(_a			):
          return temp_array
     else:
          return longest_subseq


if __name__ == "__main__":
      import doctest

      doctest.testmod()
