UserFriendly Strip Comments


	The Daily Static UF Archives Register UF Membership Ad Free Site Postcards Community Geekfinder UFie Gear Advertise on UF Forum Rules & FAQ Username Password Create a New Account

Back to UserFriendly Strip Comments Index

AOTM (Algorithm of the Moment)	by jmaxsohmer	2006-09-25 19:03:48
Interestingly, there's already an algorithm to	by Arachnid	2006-09-25 19:40:03
Its not linear per se...	by imperito	2006-09-25 19:44:08
*O(n k), actually**	by Arachnid	2006-09-25 19:49:43
Where n is the number of items, and k is the length of each item. Since the length of an item is generally independent of the number of items and constant for a given task (for example, 32 bit ints, or textual words), it's O(n). Quantum Bogosort is also O(n * k) - the same set of conditions apply.
[ Reply ]
you are imposing artificial constraints, though	by imperito	2006-09-25 19:52:22
It's not n log n	by Arachnid	2006-09-25 19:55:48
but it isn't constant.	by imperito	2006-09-25 19:57:47
No, it's not!	by Arachnid	2006-09-25 20:00:27
and what if you are sorting 10 000 000 000 of them	by imperito	2006-09-25 20:03:52
It doesn't matter.	by Arachnid	2006-09-25 20:09:35

[Todays Cartoon Discussion] [News Index]

Come get yer ARS (Account Registration System) Source Code here!
All images, characters, content and text are copyrighted and trademarks of J.D. Frazer except where other ownership applies. Don't do bad things, we have lawyers.
UserFriendly.Org and its operators are not liable for comments or content posted by its visitors, and will cheerfully assist the lawful authorities in hunting down script-kiddies, spammers and other net scum. And if you're really bad, we'll call your mom. (We're not kidding, we've done it before.)