Because an array is used to store a collection of data, it is important to know how to use them efficiently. Searching Arrays We often need to search an array to see if a value is inside of it or not. While some languages do this for you, C++, because of it’s age, doesn’t. Linear…
You pass an array to a function, very similarly as to how you would pass a non-array variable. There are two differences. You need to include square brackets after the array name so C++ knows its and array Realize that you are passing by reference. The book recommends that you always pass the size of…
An array isn’t a “data type” like you’d normally think of one. It is a collection of the same type of data, similar to a List in Python. Behind the scenes, there are a few things you need to know however: In an array, all elements must be of the same data type. When constructed,…
The first thing we should mention about this tag is that the aside tag is not for creating sidebars. It is designed to provide additional information about the main content around it. The data within the aside tag should be related to the surrounding content. Often, it is found within a section, or article, tag…
The section tag is used to define a section within a web page. Consider a situation where you had a book stored on a single page. You could use section tags to group chapters, or even sub-sections together. The section is designed to be a logical grouping of data, but not necessarily be wholly self-contained…
We’ve already seen the header tag for use as part of the header of a web page. However, a web page may have more than one header tag. Header tags may also be associated with an article, to provide header information about the article. For the head of a page, it is common to see…
In some cases you will know the path, or partial path, to the node you are looking for. This is often found when you are searching a HTML file (the Document Object Model or DOM), XML file, or similar storage structure. In that case, you can use something similar to XPATH for XML documents, or…
A depth first search algorithm analyzes the first child node for a match, and if one is not found, then it moves to that nodes children. This repeats until either a depth limit is reached, or there are no more children. Because of the complexity of some trees, consider a list of all websites to…
