Now let's move on to another type of necessary algorithms, let's see how to find elements that meet some condition or conditions so that we may perhaps carry out particular operations with them, instead of doing them for all the data we have.

These algorithms have two main variants, one, when the data structures are totally in "internal" memory and another when the data is in external "memory, being structured or not. For example, In previous articles I write the SELECT statement of the database language SQL that does not presuppose any type of storage but that in practice will have to be implemented according to the design of the data stored in the database, that is, of the "internal" architecture not visible to the user who uses SQL but that the programmers of the Database Management System will have to implement and even optimize.

To continue reading please click here.

Pin It

No thoughts on “08. Reusing code. Eighth part.”

Leave your comment

In reply to Some User