Talk:Sort using a custom comparator: Difference between revisions
Content added Content deleted
(Here ya go.) |
(Ada example incorrect) |
||
Line 7:
:Thanks for all your efforts...I've been watching the Recent Changes page, and you're one of the top two or three contributers. --[[User:Short Circuit|Short Circuit]] 11:11, 31 January 2007 (EST)
== Ada example incorrect ==
I do not understand how the Ada example is incorrect.
It uses a custom comparator.
It performs the two sorts required (descending length and ascending lexical sort).
What is the complaint?
|
Revision as of 04:41, 16 February 2007
This is a cleanup of the old Sorting page. I've started it with examples for C, Haskell, Perl, and PHP, and I'll try to get Java and Objective-C in soon. I don't believe the task (strictly speaking) is possible in a UNIX shell without invoking a more complete language like Perl.
I need people to verify/fix any relevant examples from the other languages in Sorting, and add them here (edited for consistency of course). --Bob9000 06:23, 30 January 2007 (EST)
- I created a template to help you out: Template:split-review...Add it to the tasks you create, just under {{task}}. The text to add is {{split-review}}.
- There will be a central Maintenance depot soon. Right now, Category:Maintenance will have to suffice.
- Thanks for all your efforts...I've been watching the Recent Changes page, and you're one of the top two or three contributers. --Short Circuit 11:11, 31 January 2007 (EST)
Ada example incorrect
I do not understand how the Ada example is incorrect. It uses a custom comparator. It performs the two sorts required (descending length and ascending lexical sort). What is the complaint?