fixed sorting
This commit is contained in:
@@ -40,7 +40,7 @@ for n in range(0, 25):
|
||||
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, 177100) # Chance = number call freq / all possible numbers i.e. 177100
|
||||
Forecast = str("-".join(sorted_nums))
|
||||
|
||||
@@ -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))
|
||||
|
||||
@@ -39,7 +39,7 @@ for n in range(0, 9):
|
||||
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, 10000) # Chance = number call freq / all possible numbers i.e. 10000
|
||||
Forecast = str("-".join(sorted_nums))
|
||||
|
||||
+1
-1
@@ -45,7 +45,7 @@ for n in range(0, 10):
|
||||
SB = [v[0] for v in most_common_sb]
|
||||
frequency_sb = [v[-1] for v in most_common_sb]
|
||||
|
||||
sorted_nums = sorted(likely_nums)
|
||||
sorted_nums = sorted(likely_nums, key=lambda x: (len(x), x))
|
||||
total_freq = sum(frequency + frequency_sb)
|
||||
Chance = frac(total_freq, 25989600) # Chance = number call freq / all possible numbers i.e. 25,989,600
|
||||
Forecast = str("-".join(sorted_nums))
|
||||
|
||||
+1
-1
@@ -46,7 +46,7 @@ for n in range(0, 26):
|
||||
PB = [v[0] for v in most_common_pb]
|
||||
frequency_pb = [v[-1] for v in most_common_pb]
|
||||
|
||||
sorted_nums = sorted(likely_nums)
|
||||
sorted_nums = sorted(likely_nums, key=lambda x: (len(x), x))
|
||||
total_freq = sum(frequency + frequency_pb)
|
||||
Chance = frac(total_freq, 292201338) # Chance = number call freq / all possible numbers i.e. 292201338
|
||||
Forecast = str("-".join(sorted_nums))
|
||||
|
||||
+1
-1
@@ -46,7 +46,7 @@ for n in range(0, 25):
|
||||
MB = [v[0] for v in most_common_mb]
|
||||
frequency_mb = [v[-1] for v in most_common_mb]
|
||||
|
||||
sorted_nums = sorted(likely_nums)
|
||||
sorted_nums = sorted(likely_nums, key=lambda x: (len(x), x))
|
||||
total_freq = sum(frequency + frequency_mb)
|
||||
Chance = frac(total_freq, 302575350) # Chance = number call freq / all possible numbers i.e. 11238513
|
||||
Forecast = str("-".join(sorted_nums))
|
||||
|
||||
Reference in New Issue
Block a user