Talk:Sort an integer array: Difference between revisions
Content added Content deleted
No edit summary |
(Thanks!) |
||
| Line 5: | Line 5: | ||
Once these are in place, all code examples will be removed from Sorting, and it will hold only general information and links to related tasks (and the algorithms category). |
Once these are in place, all code examples will be removed from Sorting, and it will hold only general information and links to related tasks (and the algorithms category). |
||
--[[User:Bob9000|Bob9000]] 05:30, 28 January 2007 (EST) |
--[[User:Bob9000|Bob9000]] 05:30, 28 January 2007 (EST) |
||
:Thank you! --[[User:Short Circuit|Short Circuit]] 11:01, 28 January 2007 (EST) |
|||
Revision as of 16:01, 28 January 2007
This is the first in a series of pages attempting to split up the chaos of the Sorting task. I've included my own examples for C, Haskell, Java, Objective-C, Perl, PHP, and UNIX Shell, and copied the relevant C++ examples from Sorting, with some small changes.
The other tasks I'm thinking of are "Sorting objects in natural order" and "Sorting with a custom comparator" (basically the original task given in Sorting). None of these are related to Sorting Algorithms; rather, they exist to demonstrate built-in functionality.
Once these are in place, all code examples will be removed from Sorting, and it will hold only general information and links to related tasks (and the algorithms category). --Bob9000 05:30, 28 January 2007 (EST)
- Thank you! --Short Circuit 11:01, 28 January 2007 (EST)