Anonymous user
Talk:Sort using a custom comparator: Difference between revisions
Talk:Sort using a custom comparator (view source)
Revision as of 05:39, 9 February 2008
, 16 years agoLooks like there's lots of cleaning up to be done here.
(Looks like there's lots of cleaning up to be done here.) |
|||
Line 21:
I see the problem. My second sort is case sensitive. Thanks for your patience.
:Hm. I didn't see when the <nowiki>{{incorrect}}</nowiki> template was added. Normally, when such templates are added, the reason should be mentioned in the Talk page. I don't know why that didn't happen in this case. I'll check the template and see if I can't clarify it a bit. --[[User:Short Circuit|Short Circuit]] 23:37, 18 February 2007 (EST)
== Some examples remain incorrect ==
I have not examined all the solutions by any means, but both the Ada and Common Lisp examples appear to not fit the specifications. Sgeier's elaboration (2007-09-20) is cogent, but some posted solutions continue to not implement that sorting function.
<br>For the record, I'm not sure I understand the final sentence of the task. ('Use a sorting facility provided by the language/library, combined with your own callback comparison function.') Is the use of callback crucial here? Does the J solution I posted satisfy it (and how would I know if it does)? Perhaps the task specification could be more language-neutral?
<br>Finally, many of the examples use test data that do not effectively test the requirements.
<br>--[[User:TBH|TBH]] 22:39, 8 February 2008 (MST)
| |||