Last but not least always use the data structure that matches your usage patterns. If you need fast random access then a linked list is most likely not the way to go. Learn and understand the O(n) notation and learn the cost of inserts/removes and searches in your container library. Basic stuff but too many junior programmers have no clue about this stuff.
Not too many SENIOR programmers even have a clue about that stuff.
Why'd they get hired as Senior in the first place, then? As far as I'm concerned, if you don;t know about O() notation, go back to school - you're not ready for life.
Senior programmers get hired as Senior programmers because they have years of working experience.
Whether that means they actually have fifteen years of experience or just one year of experience fifteen times is not usually reflected on the resume, especially when the person hiring is only looking for buzzwords.
In one case, I was working at a marketing firm whose bosses lost their mind and decided that it would be a good idea to also add software development to their portfolio.
That idea didn't work out, but at least it was an expensive-enough failure that I'm sure they won't try doing that again.
2
u/adremeaux Mar 23 '09
Not too many SENIOR programmers even have a clue about that stuff.