fixed sorting
This commit is contained in:
@@ -35,7 +35,7 @@ for n in range(0, 10):
|
||||
likely_nums = [v[0] for v in most_common]
|
||||
frequency = [v[-1] for v in most_common]
|
||||
|
||||
sorted_nums = sorted(likely_nums)
|
||||
sorted_nums = sorted(likely_nums, key=lambda x: (len(x), x))
|
||||
total_freq = sum(frequency)
|
||||
Chance = frac(total_freq, 15000) # Chance = number call freq / all possible numbers i.e. 1000
|
||||
Forecast = str("-".join(sorted_nums))
|
||||
|
||||
Reference in New Issue
Block a user