






"""simple docstring"""







from __future__ import annotations

import pandas as pd






def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			[0] * no_of_processes
       UpperCAmelCase	    =			[0] * no_of_processes
       # Copy the burst time into remaining_time[]
       for i in range(lowerCAmelCase		):
              UpperCAmelCase	    =			burst_time[i]

       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			999999999
       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			False

       # Process until all processes are completed
       while complete != no_of_processes:
              for j in range(lowerCAmelCase		):
                     if arrival_time[j] <= increment_time and remaining_time[j] > 0:
                            if remaining_time[j] < minm:
                                   UpperCAmelCase	    =			remaining_time[j]
                                   UpperCAmelCase	    =			j
                                   UpperCAmelCase	    =			True

              if not check:
                     increment_time += 1
                     continue
              remaining_time[short] -= 1

              UpperCAmelCase	    =			remaining_time[short]
              if minm == 0:
                     UpperCAmelCase	    =			999999999

              if remaining_time[short] == 0:
                     complete += 1
                     UpperCAmelCase	    =			False

                     # Find finish time of current process
                     UpperCAmelCase	    =			increment_time + 1

                     # Calculate waiting time
                     UpperCAmelCase	    =			finish_time - arrival_time[short]
                     UpperCAmelCase	    =			finar - burst_time[short]

                     if waiting_time[short] < 0:
                            UpperCAmelCase	    =			0

        # Increment time
              increment_time += 1
       return waiting_time






def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			[0] * no_of_processes
       for i in range(lowerCAmelCase		):
              UpperCAmelCase	    =			burst_time[i] + waiting_time[i]
       return turn_around_time






def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			0
       for i in range(lowerCAmelCase		):
              UpperCAmelCase	    =			total_waiting_time + waiting_time[i]
              UpperCAmelCase	    =			total_turn_around_time + turn_around_time[i]
       print(F'''Average waiting time = {total_waiting_time / no_of_processes:.5f}'''		)
       print("""Average turn around time ="""	,      total_turn_around_time / no_of_processes		)


if __name__ == "__main__":
 print('''Enter how many process you want to analyze''')
 lowerCAmelCase_	:    Optional[Any]            =      int(input())
 lowerCAmelCase_	:    List[Any]            =      [0] * no_of_processes
 lowerCAmelCase_	:    Optional[Any]            =      [0] * no_of_processes
 lowerCAmelCase_	:    int            =      list(range(1, no_of_processes + 1))

 for i in range(no_of_processes):
  print('''Enter the arrival time and burst time for process:--''' + str(i + 1))
  lowerCAmelCase_     ,					lowerCAmelCase_	:    Optional[Any]            =      map(int, input().split())

 lowerCAmelCase_	:    str            =      calculate_waitingtime(arrival_time, burst_time, no_of_processes)

 lowerCAmelCase_	:    str            =      burst_time
 lowerCAmelCase_	:    List[Any]            =      no_of_processes
 lowerCAmelCase_	:    int            =      waiting_time
 lowerCAmelCase_	:    int            =      calculate_turnaroundtime(bt, n, wt)

 calculate_average_times(waiting_time, turn_around_time, no_of_processes)

 lowerCAmelCase_	:    List[Any]            =      pd.DataFrame(
     list(zip(processes, burst_time, arrival_time, waiting_time, turn_around_time)),
     columns=[
         '''Process''',
         '''BurstTime''',
         '''ArrivalTime''',
         '''WaitingTime''',
         '''TurnAroundTime''',
     ],
 )

 # Printing the dataFrame
 pd.set_option('''display.max_rows''', fcfs.shape[0] + 1)
 print(fcfs)








"""simple docstring"""







def       _lowerCAmelCase       (      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			0
       UpperCAmelCase	    =			len(lowerCAmelCase		)

       for i in range(n - 1		):
              for j in range(i + 1	,      lowerCAmelCase		):
                     if arr[i] > arr[j]:
                            num_inversions += 1

       return num_inversions






def       _lowerCAmelCase       (      lowerCAmelCase		):







       '''simple docstring'''
       if len(lowerCAmelCase		) <= 1:
              return arr, 0
       UpperCAmelCase	    =			len(lowerCAmelCase		) // 2
       UpperCAmelCase	    =			arr[0:mid]
       UpperCAmelCase	    =			arr[mid:]

       UpperCAmelCase    ,       UpperCAmelCase	    =			count_inversions_recursive(lowerCAmelCase		)
       UpperCAmelCase    ,       UpperCAmelCase	    =			count_inversions_recursive(lowerCAmelCase		)
       UpperCAmelCase    ,       UpperCAmelCase	    =			_count_cross_inversions(lowerCAmelCase	,      lowerCAmelCase		)

       UpperCAmelCase	    =			inversion_p + inversions_q + cross_inversions
       return c, num_inversions






def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			[]
       UpperCAmelCase	    =			UpperCAmelCase	    =			UpperCAmelCase	    =			0
       while i < len(lowerCAmelCase		) and j < len(lowerCAmelCase		):
              if p[i] > q[j]:
                     # if P[1] > Q[j], then P[k] > Q[k] for all  i < k <= len(P)
                     # These are all inversions. The claim emerges from the
                     # property that P is sorted.
                     num_inversion += len(lowerCAmelCase		) - i
                     r.append(q[j]		)
                     j += 1
              else:
                     r.append(p[i]		)
                     i += 1

       if i < len(lowerCAmelCase		):
              r.extend(p[i:]		)
       else:
              r.extend(q[j:]		)

       return r, num_inversion






def       _lowerCAmelCase       (      ):







       '''simple docstring'''
       UpperCAmelCase	    =			[10, 2, 1, 5, 5, 2, 11]

       # this arr has 8 inversions:
       # (10, 2), (10, 1), (10, 5), (10, 5), (10, 2), (2, 1), (5, 2), (5, 2)

       UpperCAmelCase	    =			count_inversions_bf(lowerCAmelCase		)
       UpperCAmelCase    ,       UpperCAmelCase	    =			count_inversions_recursive(lowerCAmelCase		)

       assert num_inversions_bf == num_inversions_recursive == 8

       print("""number of inversions = """	,      lowerCAmelCase		)

       # testing an array with zero inversion (a sorted arr_1)

       arr_a.sort()
       UpperCAmelCase	    =			count_inversions_bf(lowerCAmelCase		)
       UpperCAmelCase    ,       UpperCAmelCase	    =			count_inversions_recursive(lowerCAmelCase		)

       assert num_inversions_bf == num_inversions_recursive == 0
       print("""number of inversions = """	,      lowerCAmelCase		)

       # an empty list should also have zero inversions
       UpperCAmelCase	    =			[]
       UpperCAmelCase	    =			count_inversions_bf(lowerCAmelCase		)
       UpperCAmelCase    ,       UpperCAmelCase	    =			count_inversions_recursive(lowerCAmelCase		)

       assert num_inversions_bf == num_inversions_recursive == 0
       print("""number of inversions = """	,      lowerCAmelCase		)


if __name__ == "__main__":
 main()
