Willows Sort
CodeChefOpen on judge ↗
Willow, a 3 years old genius, thought that sorting is based on the last digit of a number. His comparison process is if the last digit of an integer $A$ is smaller than the last digit of another integer $B$ ,then **$A$<$B$**. And if the last digit of two integers is same then he checks the previous one and this way the comparison continues. That means, if the digits of an integer $A$ is represent
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start