You are viewing a single comment's thread from:
RE: Simple C++ calculator explained
Let me know EXACTLY what tutorials you really want. No one has made suggestions yet, so you are on the top of the list! Would you rather see more C or C++? I have about 14 tutorials in C++. Here is a link to the last one (there are links to the rest of them in there):
My C++ Tutorials
These aren't about everything in C++. Just some things I thought were useful for beginners. It starts off with a lot of language neutral tutorials. When you click on the link, the topics will all be listed.
I would love to see C first, then C++. I'm thinking about it like a textbook, going systematically from one step to the next, which it looks like you are doing. Awesome stuff!
What would be really cool, just my opinion, would be posts that do something in C and then showing how to do it (easier or not) in C++, to show both and illustrate the difference for a particular task. Seems like that might be a bit of work though.
No, these are great ideas, keep them coming!
Love the tutorials. Getting into more complex data structures and algorithms, it would be great to emphasize the time complexities and space complexities of operations performed on those data structures, like with the binary search tutorial.
I can get into Big Oh. And there is a great website comparing all of the search algorithms! I just have to find it!
Awesome! So, obviously, you know what you are doing. In the case of the binary search tutorial, the first thing you pointed out was that it has to be sorted to work.
But there's obviously a cost involved with that, so adding, inserting, sorting, removing, etc... into the data structure being used, whether its represented in memory as an array, linked list, doubly-linked list, hash table where each entry points to an array (or linked list) when you get to creating dictionaries... trees, binary trees, balanced binary trees and graphs... oh the list could go on. You definitely have a lot of material to pick from!
So, getting into why you would use this data structure over that data structure for a particular implementation, maybe this data structure is fast at adding but slow at sorting, but the solution doesn't require a sorted list/array of items... etc... I think that too would be really cool and interesting to talk about.
https://www.toptal.com/developers/sorting-algorithms
It is on sorting, not searching, sorry! Still very cool to watch. Check it out!