File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change 591591
592592## Scheduling
593593 * [ First Come First Served] ( https://github.com/TheAlgorithms/Python/blob/master/scheduling/first_come_first_served.py )
594- * [ Shortest Job First Algorithm] ( https://github.com/TheAlgorithms/Python/blob/master/scheduling/shortest_job_first_algorithm.py )
594+ * [ Round Robin] ( https://github.com/TheAlgorithms/Python/blob/master/scheduling/round_robin.py )
595+ * [ Shortest Job First] ( https://github.com/TheAlgorithms/Python/blob/master/scheduling/shortest_job_first.py )
595596
596597## Searches
597598 * [ Binary Search] ( https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py )
Original file line number Diff line number Diff line change @@ -23,7 +23,7 @@ def calculate_waiting_times(burst_times: List[int]) -> List[int]:
2323 rem_burst_times = list (burst_times )
2424 waiting_times = [0 ] * len (burst_times )
2525 t = 0
26- while 1 :
26+ while True :
2727 done = True
2828 for i , burst_time in enumerate (burst_times ):
2929 if rem_burst_times [i ] > 0 :
@@ -33,7 +33,7 @@ def calculate_waiting_times(burst_times: List[int]) -> List[int]:
3333 rem_burst_times [i ] -= quantum
3434 else :
3535 t += rem_burst_times [i ]
36- waiting_times [i ] = t - burst_times [ i ]
36+ waiting_times [i ] = t - burst_time
3737 rem_burst_times [i ] = 0
3838 if done is True :
3939 return waiting_times
File renamed without changes.
You can’t perform that action at this time.
0 commit comments