mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 02:18:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

Updating scheduling/split_workload.py

Browse Source 
implementing recommendations

Co-authored-by: Tianyi Zheng <tianyizheng02@gmail.com>
This commit is contained in:
Margaret 2023-07-26 17:07:39 +03:00 committed by GitHub
parent d7437a22b6
commit f12ae10b43
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
scheduling/split_workload.py
View File

@ -28,9 +28,9 @@ def split_list(timings: list) -> tuple:
def split_workload(arr: list) -> tuple:
if len(arr) == 0:
result = ([], [], 0)
elif len(arr) == 1:
result = ([arr[0]], [], 1)
return ([], [], 0)
if len(arr) == 1:
return ([arr[0]], [], 1)
else:
n = len(arr)
smallest_diff = float("inf")