HN user

OmniLarry

27 karma
Posts0
Comments21
View on HN
No posts found.
[dead] 16 years ago

I don't think this is quite a skiplist, but it is amusing that someone's trying..

I read that as a stand-in for "Wall St", probably also because my friends usually go for Goldman now, but hedge funds are definitely where all the action is at.

Sorry, can't find the link, but it was a Topcoder problem at least 5 years ago.

Well, it is trivial with two balls, once you get it, but it's tricky with respect to "just binary search".

I was actually a charter member at the Union Square Crunch gym (the one on 3rd anyhow). Quitting was easy though, they only asked why (because I hadn't been going) and that was that.

[dead] 17 years ago

A good example given by my friend is perhaps a Dating app used by your wife, or your friend who is married.

It's true that you can look it up if you suspect it, but now you don't have to do the digging.

[dead] 17 years ago

True enough. I think the easily accessible part is somewhat important though, at least for apps that you would not look for otherwise - it's like checking if a key exists in hash, vs given a list. For the former, you can find it if you know what to look for, the latter it gives you a free look.

"Welcome to amortized analysis!"

Seriously, if the point is to educate people the difference between O(1) and O(1)A, then fine, let people understand the difference. The problem is that he thinks the solution is to scrap it altogether.

It's almost like, hey guys, Quicksort isn't really O(n log n), it only is on average! (Of course, the STD uses introsort.. ;))