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:
Christian Clauss 2020-07-03 21:26:40 +02:00 committed by GitHub
parent e274863cda
commit 2c98dce057
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 4 additions and 3 deletions

View File

@ -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)

View File

@ -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