Of course learning algorithms is important, but it can be done alongside practical work. I'm just watching the first MIT algorithm video now to see what you have learned from it. The guy talks about having to hand in code as homework. Strange that. Surely he'd prefer essays according to you. I find it kind of weird that the professor needs a sheet of notes to show an insertion sort algorithm that to me doesn't inspire confidence in his teaching.
Not at all. Notes are great. That makes it so the professor can write down the algorithm, test it for mistakes and ensure that they doesn't waste time trying to find and fix bugs in what they've written. Always prefer teachers who use notes because it means they've put time and effort into the actual class!Originally Posted by Hobbit
Ooh, back to C++ vs C, you can use implicit conversion operators.
This way, it's easy to just if `if (x) p[x]`Code:// used to represent a potentially invalid index of an array // NOT a complete implementation struct index_t { long long int v; // assume 64 bit architecture ftw index_t(void) : v{-1} {} index_t(long long int u) : v{u} {} operator bool() const { return v >= 0; } };
You are simply ignoring the overall points made by others at this point to pontificate about something that nobody really objects about, i.e., that theory is valuable.
In theory, we could keep going at this until this message board reaches its end of life. In practice, you need to stop posting here and start doing something productive, whether it is studying theory or applying it for practical programming, so I shall close this thread for your own good.
If you have more specific questions on some aspect of the theory or practice of computer programming, feel free to start a new topic thread to ask about it. But if you wish to keep pontificating about TAOCP when nobody is saying that you shouldn't study it, I will simply close or delete such a thread.
Look up a C++ Reference and learn How To Ask Questions The Smart Way
