Had to turn the sound down eventually.

Geek Speak » in reply to Bonus link from Buck's Wonkblog Post

TB — 8/2/2013 3:19:19 AM (archived)

I looked up the "bogosort." The example given was sorting a deck of cards by throwing it into the air, piling it up, seeing if it was sorted, and if not, throwing it up in the air again. You'd wait a long time for that one to finish (8 * 10^67 combinations).

The whole thread (13 posts)

Bonus link from Buck's Wonkblog Post - ER - 8/1/2013 11:50:29 PM
- For a good time, download the software - Robert - 8/2/2013 5:01:41 AM
  - tips - Robert - 8/2/2013 5:05:38 AM
- Had to turn the sound down eventually. - TB - 8/2/2013 3:19:19 AM
- When we had to write a sort... - alcaray - 8/2/2013 2:24:56 AM
- And we had to sort uphill both ways - Robert - 8/2/2013 1:23:19 AM
  - ER gets the credit for that one - TB - 8/2/2013 1:59:02 AM
    - oops - Robert - 8/2/2013 2:06:32 AM
      - Heh. - TB - 8/2/2013 3:12:03 AM
      - I can only admit my ignorance... - ER - 8/2/2013 2:27:47 AM
        
        binary sort has uses far beyond coded sorts. - alcaray - 8/2/2013 6:16:04 PM
        
        Actually the term 'binary search' fits better than 'binary sort' the way I described it. - alcaray - 8/2/2013 6:40:21 PM
        
        a binary sort is just the age-old principle of divide-and-conquer - Robert - 8/2/2013 4:33:31 AM

Recent posts

On this day in Geek Speak

The whole thread (13 posts)

Related discussions