Algorithms

When seeking to solve a problem with an algorithm, it's essential to measure its efficiency. Complexity allows estimating the necessary resources (time, memory) based on the size of data to process.

When retrieving data, for example from a CSV file, it's essential to protect variables that must remain unchanged. We'll see some simple best practices to avoid involuntary errors.

When programming a loop, it's often useful to be able to reason about what doesn't change during its execution. This is called a loop invariant.

A cellular automaton consists of a regular grid of "cells", each containing a "state" chosen from a finite set and which can evolve over time. The state of a cell at time t+1 is a function of the state at time t of a finite number of cells called its "neighborhood". At each new unit of time, the same rules are applied simultaneously to all cells in the grid, producing a new "generation" of cells that depends entirely on the previous generation.

Selection sort is a simple sorting algorithm that works by selecting the smallest (or largest) element from a list and placing it in the correct position. It's often used to illustrate basic sorting algorithm concepts.

Insertion sort is a simple sorting algorithm that works by inserting each element into its correct position in the already sorted portion of the array. It is often used to illustrate basic sorting algorithm concepts.

Binary search is an efficient search algorithm that works by recursively dividing a sorted list into two halves until the searched element is found or it is no longer possible to divide the list.