5 ms·
Isn't this the sort of table that shows its author is a L337 hax0r because he's in the top category of everything? Anyone who automatically puts things like DVC
by Silhouette 17y ago
Isn't this the sort of table that shows its author is a L337 hax0r because he's in the top category of everything? Anyone who automatically puts things like DVCS, TDD, and practices obviously related to Open Source development in the top tier sounds more like a Kool-Aid drinker than an objective observer making a sincere attempt to provide a useful resource.
- jrockway 17y agoThese things are heuristics, not things that actually make you good. Look at "has tried bzr/hg/git". That's probably true of the best programmers. But trying git for one day is not going to make you one of the best programmers.
- trjordan 17y agoLast time this came up, somebody made the comment that you're in the highest category that you have finished everything below. Just because you started with git doesn't make you good at VCSs, but if you have done everything below it as well, you probably are an expert. To put it another way: would you put SVN on the right side of that row? As an aside, I do believe that DVCSs are somewhat more complicated than their centralized counterparts. This is mostly because they are young and lack the mature tool environment that things like SVN do. As a result, users are forced to understand how they work, instead of relying on pre-defined sequence of work->save->test->commit. If SVN was the new hotness, people would have written reams about the theoretical motivations behind a a centralized server, copying-as-branching, etc. But it's not, so git/hg/bzr get all the credit for being algorithmically interesting. In the end, this means that if you don't want to think about it, go with a VCS that's a little older, and I think that justifies the ordering in the chart.
- nostrademons 17y agoA lot of the O(log N) items were depressingly basic. An undergrad education in CS will get you to O(log N) in basically all the Computer Science categories. Where are the finger trees? Array-mapped hash tries? Cuckoo hashes? Where's the domain-specific algorithm knowledge, like machine learning or information retrieval or computer vision? The IDE plugins? "Let it crash" and supervisor processes for error handling? It's also depressing that O(log N) for "years of experience" = 10+. A motivated and reasonably intelligent student can get to O(log N) in all the other categories with an undergraduate CS degree and about 2 years of work experience at a good employer.
- antirez 17y agoHey, didn't you noticed that the O(1) column was missing?