In the previous lesson , we introduced both containers and arrays. In this lesson, we’ll introduce the array type that we’ll be focused on for the rest of the chapter: std::vector. We’ll also solve one part of the scalability challenge we introduced last lesson. Introduction to std::vector std::vector is one …
In lesson , we introduced containers and arrays. To summarize: Containers provide storage for a collection of unnamed objects (called elements). Arrays allocate their elements contiguously in memory, and allow fast, direct access to any element via subscripting. C++ has three different array types that are commonly used: std::vector, std::array, …
This lesson is optional, for advanced readers who want to learn more about C++. No future lessons build on this lesson. A pointer to a pointer is exactly what you’d expect: a pointer that holds the address of another pointer. Pointers to pointers A normal pointer to an int is …
In the previous lesson on bitwise operators (), we discussed how the various bitwise operators apply logical operators to each bit within the operands. Now that we understand how they function, let’s take a look at how they’re more commonly used. In order to manipulate individual bits (e.g. turn them …
In addition to dynamically allocating single values, we can also dynamically allocate arrays of variables. Unlike a fixed array, where the array size must be fixed at compile time, dynamically allocating an array allows us to choose an array length at runtime (meaning our length does not need to be …
In the previous lesson (), we discussed how to create and initialize C-style string objects: #include <iostream> int main() { char name[]{ “Alex” }; // C-style string std::cout << name << ‘\n’; return 0; } C++ supports two different ways to create C-style string symbolic constants: #include <iostream> int main() …
In lesson , we mentioned that arrays are stored sequentially in memory. In this lesson, we’ll take a deeper look at how arrays indexing math works. Although we won’t use the indexing math in future lessons, the topics covered in this lesson will give you insight into how range-based for …
In the previous lesson (), we covered the basics of pointers, which are objects that hold the address of another object. This address can be dereferenced using the dereference operator (*) to get the object at that address: #include <iostream> int main() { int x{ 5 }; std::cout << x …
Now that we’ve covered what functions are and some of their basic capabilities, let’s take a closer look at why they’re useful. New programmers often ask, “Can’t we just put all the code inside the main function?” For simple programs, you absolutely can. However, functions provide a number of benefits …
In lesson , we showed examples where we used a for-loop to iterate through each element of an array using a loop variable as an index. Here’s another example of such: #include <iostream> #include <vector> int main() { std::vector fibonacci { 0, 1, 1, 2, 3, 5, 8, 13, 21, …
