def sort_and_sow(job, bins):
    ''' sorts the jobs by time then put them in bin[0..bins-1] in the order bin[o..bins..0..bins..]'''
    job.sort()
    bin = list()
    for i in range(bins):
	bin.append(job[i::2*bins] + job[2*bins-1-i::2*bins])
	bin[-1].sort()  # Sort makes more tests finish early
    return bin
 sorts the jobs by time then put them in bin[0..bins-1] in the order bin[o..bins..0..bins..]
recipes/Python/280030_Optimising_RegressiTesting_COmpute/recipe-280030.py