That's something I would disagree with though. "Sticking with plain HTML and CSS" is way more work, and often has significantly less functionality, than building a website with a framework.
That's something I would disagree with though. "Sticking with plain HTML and CSS" is way more work, and often has significantly less functionality, than building a website with a framework.
It's very pedantic, but he does have a point. Similar to how you could view memory usage as O(1) regardless of the algorithm used, just because a computer doesn't have infinite memory, so it's always got an upper bound on that.
Only that's not helpful at all when comparing algorithms, so we disregard that quirk and assume we're working with infinite memory.
As far as I know, they do - for Steam keys. If you're selling your game through other stores, not just a Steam key, there aren't any demands placed upon you. The OC might've been talking about that.
Why not just use soft links instead?
Huh, interesting... You know, I've never really wondered about Humble Bundle specifically, but you're right, they seem to be selling your run-of-the-mill Steam keys, or at least you can activate them effortlessly in Steam. Maybe it's a case of Steam themselves handing out keys (instead of the publishers) to increase user retention? I honestly don't know, this is all just speculation.
I actually didn't click on your link at first, because I assumed it would just show other stores where you could purchase the whole game instead of a key, so I'm sorry that you had to clarify that.
Late reply, but for me personally, I started doing it because my Keepass database is already accessed using two factors (password and key file). Therefore, I'd gain very little by keeping the second factor of those sites external - essentially, those second factors are compounded into the second factor for the database.
But you just completely ignored everything I said in that comment.
Mathematically, that is precisely how O notation works, only (as I've mentioned) we don't use it like that to get meaningful results. Plus, when looking at time, we can actually use O notation like normal, since computers can indeed calculate something for infinity.
Still, you're wrong saying that isn't how it works in general, which is really easy to see if you look at the actual definition of O(g(n)).
Oh, and your computer crashing is a thing that could happen, sure, but that actually isn't taken into account for runtime analysis, because it only happens with a certain chance. If it would happen after precisely three days every time, then you'd be correct and all algorithms would indeed have an upper bound for time too. However it doesn't, so we can't define that upper bound as there will always be calculations breaking it.
Sorry, I mistakenly assumed you were talking about disk storage - sure, if you're designing your own solution, definitely use tags! Although the ones Gmail uses aren't really portable in my experience, so you're forced to use their mail client. That, however, is pretty much unavoidable if you're putting a new spin on established protocols like they're doing - maybe those changes will get picked up by other clients, maybe they won't, who knows?
That's true, but since we're stuck with the file/folder system for all intents and purposes, you should be able to replicate that behaviour by making those tags part of the filenames (like rent_lease_landlordX.pdf) and searching for (parts of) filenames instead. But yes, a dedicated system would of course be preferable.
Wow, writing the same paragraphs three times... What an abomination of an article.