b3ta.com board
You are not logged in. Login or Signup
Home » Messageboard » XXX » Message 10481043 (Thread)

#

(, Mon 18 Jul 2011, 18:37, archived)
# i have no idea what's going on here
but i like it.
(, Mon 18 Jul 2011, 18:40, archived)
# bees must sort flowers into order
MUST SORT FLOWERS
(, Mon 18 Jul 2011, 18:50, archived)
# They have OCBee!
(, Mon 18 Jul 2011, 18:53, archived)
# Beeline personality
(, Mon 18 Jul 2011, 18:54, archived)
# Oh Tribs...
Tribs...
(, Mon 18 Jul 2011, 18:58, archived)
# That's what she said
(, Mon 18 Jul 2011, 19:46, archived)
# that's a lot of hard work
you'd think they'd just take the pollen and be grateful
(, Mon 18 Jul 2011, 18:55, archived)
# busy bees:D
(, Mon 18 Jul 2011, 18:52, archived)
# Ah. Tall daisy syndrome.
(, Mon 18 Jul 2011, 18:55, archived)
# is that anything like talking hump syndrome?
(, Mon 18 Jul 2011, 18:58, archived)
# Don't ask me.
I prefer to let the hump do the talking.
(, Mon 18 Jul 2011, 19:03, archived)
# always wise, especially if it's swearing at your enemies
you can't possibly be blamed for anything your hump says.
(, Mon 18 Jul 2011, 19:09, archived)
# The hump usually just says "Knickers!" and cackles to itself.
So it's a far more effective spokesman for me than I am.
(, Mon 18 Jul 2011, 19:33, archived)
# mine says "cock!"
i usually just thinjk it.
(, Mon 18 Jul 2011, 19:38, archived)
# I like these
(, Mon 18 Jul 2011, 18:56, archived)
# I still don't understand these?
WOO!
(, Mon 18 Jul 2011, 19:02, archived)
# It's an illustration of a sorting algorithm
but that's not much help because I don't know which algorithm. Seems like one bee swaps a flower with the other bee... a certain flower. Using mysterious bee intuition to choose which one.
(, Mon 18 Jul 2011, 19:12, archived)
# It's another one I made up,
I've tentatively called it Split Sort. The array is split exactly in half, the bottom half is built up into a max heap and the top half is built into a min heap, but with extra swaps so that the max of the max heap ends up less than the min of the min heap. Then it recurses. So it's kind of like Quicksort except instead of taking a guess at the median, it works it out exactly.
(, Mon 18 Jul 2011, 19:16, archived)
# Wowzers!
(, Mon 18 Jul 2011, 19:30, archived)
# Obsessive bees is best bees
(, Mon 18 Jul 2011, 19:07, archived)
# YES
(, Mon 18 Jul 2011, 19:16, archived)
# Can you make a bibble sort?
I made it up, it goes bibble bibble and ends up with a smiley face :)
(, Mon 18 Jul 2011, 21:03, archived)
# Whoa.
Nice.
(, Mon 18 Jul 2011, 23:57, archived)