Round 1 Results --------------- Name Score ------------------------- Brian Haskin 8 Ilmari Karonen 7 Mole IX 5 Philipp Offermann 4 Zul Nadzri 3 Robert Hale 2 Christian Schmidt 1 Seaside sort (length 31) by Brian Haskin Notes: works, fastest program Average cycles: 320907 Bubbly Sort 1b (length 10) by Ilmari Karonen Notes: works, smallest program Average cycles: 13505607 Particle Sorter (length 12) by Mole IX Notes: works, could be made a little bit faster :-) Average cycles: 11644522 PSort v1.0 (length 12) by Philipp Offermann Notes: works Average cycles: 11998609 Sort v1.5 (length 20) by Zul Nadzri Notes: doesn't work for ITEMS==0 Average cycles: 9066053 Consort (length 14+1) by Robert Hale Notes: I had to add an extra line to make this terminate properly (it assumes that the data consists of DAT instructions). I also had to change some mov.i instructions to mov.f. This also sorts the list in descending order. Apart from these details, it works just fine. :-) Average cycles: 27968360 Sortidator (length 31) by Christian Schmidt Notes: doesn't work for ITEMS==0 or ITEMS==CORESIZE/2 Average cycles: 68427233