Skip to content

Sorting algorithm that sorts on an array of integers based on the frequency. If the frequency is the same, then the natural ordering is used.

Notifications You must be signed in to change notification settings

abelen/FrequencySort

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

FrequencySort

Common Interview Question that comes up where you are asked to sort integers in an array based on the frequency. If there are ties, then you sort the integers in their natural order. For example: if given the array: [5, 2, 3, 1, 5, 5, 7, 10, 7]. This function should return: [5, 5, 5, 7, 7, 1, 2, 3, 10].

About

Sorting algorithm that sorts on an array of integers based on the frequency. If the frequency is the same, then the natural ordering is used.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages