Re^2: Numeric sorting WITHOUT <=>

Not my idea, its for a class. That might work but he hinted at using nested loops to numerically sort the keys.

Comment on Re^2: Numeric sorting WITHOUT <=>

Replies are listed 'Best First'.
Re^3: Numeric sorting WITHOUT <=> by AnomalousMonk (Archbishop) on Oct 09, 2012 at 22:31 UTC
Ah: "Give a man a fish and he will eat for a day. Tell a man to beat the fish to death with a baseball bat and he will happily use a fishing hook and line for all the rest of his days."	[reply]
Re^3: Numeric sorting WITHOUT <=> by dsheroh (Monsignor) on Oct 10, 2012 at 09:40 UTC
If he's talking about nested loops, then you're probably not supposed to use the Perl `sort` function at all, but instead to implement a sorting algorithm from scratch. Hopefully, then, the class has already covered at least one sorting algorithm for you to implement. If not, google can provide explanations of how several sorting algorithms work, then it's just a matter of translating the algorithm's description into Perl code.	[reply] [d/l]