Trees – Traversal Post-order
Permalink

Trees – Traversal Post-order

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

Continue Reading →

Trees – Traversal Pre-order
Permalink

Trees – Traversal Pre-order

GREEDY – Scroll horse chess board example
Permalink

GREEDY – Scroll horse chess board example

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

Continue Reading →

Graphs – Tree Depth-first search
Permalink

Graphs – Tree Depth-first search

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

Continue Reading →

Diagram Voronoi
Permalink

Diagram Voronoi

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

Continue Reading →

Condensation pivotal determinants calculation method
Permalink

Condensation pivotal determinants calculation method

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

Continue Reading →

Sorting – Bubble sort
Permalink

Sorting – Bubble sort

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

Continue Reading →

Divide et Impera – Hanoi algorithm
Permalink

Divide et Impera – Hanoi algorithm

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

Continue Reading →

Lists – Example with students
Permalink

Lists – Example with students

List with students: #include <stdio.h> #include <string.h> #include <malloc.h> #include <ctype.h> #include <conio.h> typedef struct…

Continue Reading →

Display 2 crowds
Permalink

Display 2 crowds

// Afisarea a doua multimi #include<stdio.h> #include<conio.h> void main(void) { int a[99],b[99],i,j,n,m ; char c='f';…

Continue Reading →