Pages

Wednesday, 22 April 2009

Animated Sort Algorithms

http://www.sorting-algorithms.com/

16 comments:

  1. Brilliant.

    I had a course on parallel programming during my undergrad, we did bubble sort and some other kind. Never really appreciated what they actually looked like. This makes it look quite intuitive (relatively, anyway).

    ReplyDelete
  2. Pah!
    I wrote an animated bubble sort on a Nascom 1.
    In assembler.
    [checks calendar] Yoiks! Thirty years ago :-(

    ReplyDelete
  3. Good gad man! Bubble sort in parallel - It'll never fly - that couldn't have worked! (unless, pehaps, if one thread starts at the top, and the other at the bottom - and you accept there's gonna be data clashes and therefore the set mightn't be quite-sorted- Hey, I like the sound of Quitesort!)

    ReplyDelete
  4. ... I don't think we did bubble sort actually in parallel - but it was all part of the examination of 'number of steps'. I honestly can't remember. I'm only left with phrases and names: Amdahl, bubble sort, hypercube...

    ReplyDelete
  5. ...everybody talk about POP MUSIC!

    ReplyDelete
  6. I'm sure I'd remember the Professor say *that*!

    (That would be surreally brilliant)

    ReplyDelete
  7. I once tried to think of a recursive occam seed-fill algorithm... but then Awol had to reboot me

    ReplyDelete
  8. There is definitely some boot needed around here...

    ReplyDelete
  9. Recursion in occam, now there's a thing.

    ReplyDelete