Honey, where's my coding t-shirt?
Last time we took a look at the two simplest and basic search algorithms, binary and linear search, and I mentioned at the end that binary search is a good example of an algorithm that can be expressed in recursive way (and even analyzed its performance using the master theorem …
Another problem that goes hand by hand with sorting is the classical searching problem (and sometimes they need each other to work) and as sorting there are a few algorithms to pick from (sadly not as many as with sorting though). In its simplest form we just go through a …
Now it is time to make a pause in our basic data structures and start taking a look at some sorting algorithms. For simplicity these algorithms will be explained using an arrays or lists and it will be done in place (that means every sort will sort the container instead …
The stack is pretty much one of those simple data type abstraction types that most of us give for granted, I mean, most developers that I know will probably answer back many situation or cases where they need to use a queue but not when and why did they use …
We already talked about queues and how to implement them using arrays and “lists” so I think I should expand a little more about why we do the differentiation between arrays (or vectors) and lists.
A big difference between linked lists (not list, I will clarify later why) and vectors …