@palmerj3 The thing is it's true for everything. Work at one place too long and you'll pick up habits unique to those places.
The best engineers can adapt. Bad ones get stuck in their habits.
@Hadrio_Official@palmerj3 There's gaming things in startups too. For example get an engineer who is good at getting SBIRs and nothing else and he'll appear on paper like he's great at what he does.
But SBIRs eventually run out and you need to actually have a product at the end.
@zekramu Spend a ton of time at any place and you'll have habits that don't translate. I worked all three and they emphasize different skill sets. The same skill sets get them into trouble when it's a different environment.
@wyqtor@robinhanson Except that in practical applications you can't prove it will be correct for every possible set of inputs/outputs.
That's even true in mathematics. Practical fields use things that may not be right, but work because rigor is slow and we need stuff to happen now.
@TrisH0x2A Well as much as I like Python. To be fair, many other languages do not require you to learn a special library to make it fast.
That's why it's a slow language. Because you need to jump through hoops to make it fast.
I'm reading these posts as someone who previously made $23k/y in graduate school and could hardly afford to eat subway, let alone take out!
I had to cook at lot at home for 3-4 years. Anyone acting like they don't have the ability to is embarrassing!
I am losing sympathy fast for a lot of the people complaining.
@blythesylph@JeremiahDJohns@MostlyMonkey Bullcrap. When I was a single graduate student making $23k/y I could only afford subway half the time.
I made a lot at home.
@Michael34664811@chronicLarper@graykevinb Not true at all. Try working on molecular simulations on some of the biggest computing clusters in the world.
I guarantee you'll feel the gap between O(N log(N) ) and O(N^2) very quickly.
@The_CEO_Cat@graykevinb As N approaches infinity. The problem is it's a question of how much you expect your app to scale.
Storing millions of user's data in a big database? Yeah you got a pretty big scaling problem.
Sorting an array of 20 elements? No you don't have that.
@OlexGameDev@graykevinb It's still true, but like anything if you use it as a hard and fast rule instead of a guideline you'll always been inefficient.
It's one metric to consider out of several.
For example Bubble sort is faster than Q-sort if your array is already mostly sorted.
@HoffPeterA@sudox7 Yes very close. Try to come up with an integer system that is general for an arbitrary data structure. Then let me know how much memory you use.
Or did you forget most production C code uses Structs or similar structures all over the place?