Talk:Sorting algorithms/Permutation sort: Difference between revisions
Talk:Sorting algorithms/Permutation sort (view source)
Revision as of 13:13, 26 November 2010
, 13 years ago→References & Disclaimer for Permutation Sort
No edit summary |
|||
Line 13:
Also, when the task description isn't explicit about data structure support (eg list/array), I've noticed that most implementations only support arrays and a few implementations will support both data structures (or even a generic "sequence"). Is there a standard convention in place for noting when this occurs? Obviously, generic support is much more desirable. Just some thoughts...
: O(n!) issue would be for large data sets, and mostly you just have to hit break, cancel, or something of that nature if you try that. Meanwhile, a search for permutation sort got me half a million hits. The first hits were this pair of pages, but I also found stuff like: http://www.exso.com/courses/cs101b/slides/pure/node10.html --[[User:Rdm|Rdm]] 13:13, 26 November 2010 (UTC)
| |||