Discussing the article: "From Basic to Intermediate: Queues, Lists, and Trees (I)"

New comment
 

Check out the new article: From Basic to Intermediate: Queues, Lists, and Trees (I).

In this article, we'll begin exploring a short series of concepts that are of immense importance to anyone who truly wants to learn how to program properly. Since this may seem very complicated at first—even though it is based on simple elements—we will go through the material step by step. So, let's start by figuring out what queues are.
In the previous article, "From Basic to Intermediate: Like Bubbles", we showed how to implement a very simple sorting mechanism. Although this may not be very efficient in terms of execution time, in many cases this approach is suitable for a wide range of situations where the goal is to order a data set, thereby making it easier to interpret and to perform simple searches within it.

The mechanism described in the previous article does not always operate on its own. In most cases, sorting and search systems are associated with other types of mechanisms. In this article, we will examine one of these mechanisms.

Indeed, although we are still focusing on basic content, some people may find the topics covered here more advanced. However, all of this is related to the fundamentals that every professional programmer should know.

All right, to get off on the right foot, let's move on to a new topic. Please keep in mind that if you have trouble understanding the information presented here, or if the discussion involves topics not covered in this article, you should refer to the previous articles. There you will find all the information you need to understand this article.


Author: CODE X

New comment