> at my school, SJSU, there are several math professors from Stanford and Princeton teaching there
You were bashing on schools like, "USC, UCSC, UCSB, UC Davis, UCI, UCR, and, god, I must be missing some. Oh yeah, UC San Diego." and calling the mediocre? HA!
You go to SJSU and are calling those UC's mediocre?? I don't know how you got to the top of HN, but you need a HUGE perspective change dude...
It's good that they finally mentioned it at the end - this is a flavor of the optimal stopping problem (http://en.wikipedia.org/wiki/Optimal_stopping). This is a cute application of that strategy, the problem is that mathematics has very little to do with actual relationships, as much so as the assumptions game theory makes about actual relationships (http://crookedtimber.org/2005/10/13/whats-wrong-with-game-th...). Whats more important than trying to play your luck in a relationship is: working through the grit of an actual relationship.
In reality - if you don't put in the actual work any single relationship takes, then none of them will work out, it doesn't matter how large your "sample size" is.
That's actually very interesting, I've had to implement bounds checking in a C-style language, and it definitely was a lot of fun and required some thorough checks. What's taken into consideration when designing the iterator API? Could you please provide an example of using a properly designed iterator API?
Last year I went to a tech talk where the creator of Xiki was showing off the product's features set. He has definitely put a lot of thought into it's design, and Xiki improves a developers workflow once you get use to the commands. I believe the creator also offered anyone who wanted to pair-program with him a call; definitely wish I had jumped on that opportunity.