mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 15:01:08 +00:00
Rename shortest_job_first_algorithm.py to shortest_job_first.py (#2164)
* Rename shortest_job_first_algorithm.py to shortest_job_first.py * updating DIRECTORY.md * Minor tweek to round_robin.py Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
parent
e274863cda
commit
2c98dce057
|
@ -591,7 +591,8 @@
|
|||
|
||||
## Scheduling
|
||||
* [First Come First Served](https://github.com/TheAlgorithms/Python/blob/master/scheduling/first_come_first_served.py)
|
||||
* [Shortest Job First Algorithm](https://github.com/TheAlgorithms/Python/blob/master/scheduling/shortest_job_first_algorithm.py)
|
||||
* [Round Robin](https://github.com/TheAlgorithms/Python/blob/master/scheduling/round_robin.py)
|
||||
* [Shortest Job First](https://github.com/TheAlgorithms/Python/blob/master/scheduling/shortest_job_first.py)
|
||||
|
||||
## Searches
|
||||
* [Binary Search](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py)
|
||||
|
|
|
@ -23,7 +23,7 @@ def calculate_waiting_times(burst_times: List[int]) -> List[int]:
|
|||
rem_burst_times = list(burst_times)
|
||||
waiting_times = [0] * len(burst_times)
|
||||
t = 0
|
||||
while 1:
|
||||
while True:
|
||||
done = True
|
||||
for i, burst_time in enumerate(burst_times):
|
||||
if rem_burst_times[i] > 0:
|
||||
|
@ -33,7 +33,7 @@ def calculate_waiting_times(burst_times: List[int]) -> List[int]:
|
|||
rem_burst_times[i] -= quantum
|
||||
else:
|
||||
t += rem_burst_times[i]
|
||||
waiting_times[i] = t - burst_times[i]
|
||||
waiting_times[i] = t - burst_time
|
||||
rem_burst_times[i] = 0
|
||||
if done is True:
|
||||
return waiting_times
|
||||
|
|
Loading…
Reference in New Issue
Block a user