## Trees – Traversal Post-order

Check if the current node is empty / null Traverse the left subtree by recursively…

## Trees – Traversal Pre-order

Check if the current node is empty / null Display the data part of…

## GREEDY – Scroll horse chess board example

Greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the…

## Graphs – Tree Depth-first search

In mathematics, and more specifically in graph theory, a tree is an undirected graph in…

## Diagram Voronoi

In the simplest case, shown in the first picture, we are given a finite set…

## Condensation pivotal determinants calculation method

//Calculul determinantilor cu metoda condensarii pivotale #include <conio.h> #include <iostream> #include <math.h> #include <stdlib.h> using…

## Sorting – Bubble sort

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly…

## Divide et Impera – Hanoi algorithm

Towers of Hanoi problem – Method Divide et impera BRIEF three rods A, B, C…