Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
sort | list_comprehension | Counter().most_common solution in Clear category for Frequency Sorting by vinicius.rznd
from collections import Counter
def frequency_sorting(numbers):
# sorts for unique numbers
numbers.sort()
# sorting on basis of frequency of elements
result = [item for items, c in Counter(numbers).most_common() for item in [items] * c]
return result
# NOTE: The list comprehension is equivalent to this:
#result = []
#for item, c in Counter(numbers).most_common():
# for element in [item] * c:
# result.append(item)
#print(result)
if __name__ == '__main__':
print("Example:")
print(frequency_sorting([1, 2, 3, 4, 5]))
#These "asserts" using only for self-checking and not necessary for auto-testing
assert frequency_sorting([1, 2, 3, 4, 5]) == [1, 2, 3, 4, 5], "Already sorted"
assert frequency_sorting([3, 4, 11, 13, 11, 4, 4, 7, 3]) == [4, 4, 4, 3, 3, 11, 11, 7, 13], "Not sorted"
assert frequency_sorting([99, 99, 55, 55, 21, 21, 10, 10]) == [10, 10, 21, 21, 55, 55, 99, 99], "Reversed"
print("Coding complete? Click 'Check' to earn cool rewards!")
Dec. 30, 2020
