On Fri, May 13, 2011 at 2:15 PM, Shane Hathaway <sh...@hathawaymix.org>wrote:
> On 05/13/2011 01:44 PM, Merrill Oveson wrote: > > big-O? > > Let's say an algorithm iterates over a list, and for each element in the > list, iterates *again* over the entire list. This is O(n^2) behavior > and is usually naive. > > Another algorithm might use hashes and buckets. It still has to iterate > over every element of the list, but for each element, it only has to > look at the buckets, and the number of buckets is relatively small. > This kind of algorithm probably has O(n log n) behavior, which usually > scales a lot better. > You know you are a geek when you use big-O to describe why you use virtual desktops with a direct keystroke for each desktop O(1) rather than one desktop and alt-tab to change windows O(n). -- Spencer /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
