Week 8 Day 1 - Templates
Today we talked a bit about the homework assignment, with some ideas on how you should sort a linked list (not efficiently, but well enough to get the homework done).
We then ran through some examples of using stacks. Stacks are a LIFO (last in first out) data structure. Really simple, can be implemented in a heartbeat, but used in a lot of different places in computer science.
Finally, we talked about templates - which is to say, being able to create functions and classes where you can specify the type at a later date. This allows you to write a function or data structure once, rather than once for every type. You use angle brackets to specify which type the class or function can use, and C++ can sometimes deduce the type as well, so you don't need to type it at all.
Other Videos By Bill Kerney
2021-03-06 | Week 7 Day 3 - Is/Ought |
2021-03-05 | Lecture 8 - Procedural Generation |
2021-03-05 | Week 8 Day 3 - Deques, Pairs, Tuples |
2021-03-04 | Week 8 Day 2 - Cross Product |
2021-03-04 | Week 8 Day 2 - SIMD |
2021-03-04 | Week 7 Day 2 - Modal Logic |
2021-03-03 | Week 8 Day 2 - Memory Leaks, RPG 41 |
2021-03-02 | Week 8 Day 1 - Dot Products |
2021-03-02 | Week 8 Day 1 - Out of Order Execution, Register Renaming, Superscalar |
2021-03-02 | Week 7 Day 1 - Quantifiers |
2021-03-01 | Week 8 Day 1 - Templates |
2021-02-28 | Week 7 |
2021-02-28 | Week 7 Day 3 - Deep Copies, Stacks |
2021-02-27 | Week 6 Day 3 - Moar Midterm Review |
2021-02-25 | Week 7 Day 2 - Vector Math |
2021-02-25 | Week 7 Day 2 - Pipelining |
2021-02-24 | Week 7 Day 2 - Debugging II and Queues |
2021-02-24 | Week 6 Day 2 - Midterm Review |
2021-02-23 | Week 7 Day 1 - The Triangle in Games |
2021-02-23 | Week 7 Day 1 - Classes in C and Assembly |
2021-02-23 | Week 6 Day 1 - Fallacies III |