Revision as of 13:10, 1 October 2006 edit Ruud Koot (talk \| contribs) 31,416 edits m intro ← Previous edit		Revision as of 14:07, 1 October 2006 edit undo Nils Grimsmo (talk \| contribs) 567 edits →Rank-sort: reformulate Next edit →
Line 27: ===Rank-sort=== ~~If you don't like big ugly programs, you~~You can ~~try~~sort ~~the much nicer Rank-sort.~~in <math>\Theta(\log n)</math> time, with rank-sort. You need <math>\Theta(n^2)</math> prosessors, and do <math>\Theta(n^2)</math> work. Program ranksort

UNITY (programming language): Difference between revisions