// Program sortare prin interclasare. Datele se gasesc in fisierul SIR.DAT #include<stdio.h> #include<conio.h> #define N 100 void Interclasare(int a, int…
Read More
Quadratic equation
In algebra, a quadratic equation (from the Latin quadratus for “square“) is any equation that can be rearranged in standard…
Read More
Overloaded fractions
HEADER FILE class Fractie { public: int numarator,numitor; public: Fractie(int numarator=0,int numitor=1); Fractie Suma(Fractie,Fractie); Fractie Diferenta(Fractie, Fractie); Fractie Produs(Fractie, Fractie);…
Read More
Graham – algorithm
Graham’s scan is a method of finding the convex hull of a finite set of points in the plane with…
Read More
Fibonacci – recursive algorithm
Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that…
Read More
Graphs – related components(algorithm)
To determine connected components we use the method of access depth of a graph. Algorithm steps are: -P1: Is seeking…
Read More
Polinom – derivate(algorithm in C)
#include<stdio.h> #include<conio.h> int a,i,j,k,n,l; void main() { printf("Gradul polinomului<20:");scanf("%d",&n); for(i=0;i<=n;i=i+1) { printf("a(%d)=",i);scanf("%d",&a); } printf("Se deriveaza de :");scanf("%d",&k); for(j=0;j<k;j++) { a=0;…
Read More
Euclid algorithm
In mathematics, the Euclidean algorithm, or Euclid’s algorithm, is an efficient method for computing the greatest common divisor (GCD) of…
Read More
Queue – algorithm (Sample 1)
Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is open at both its ends.…
Read More
The longest substring ascending – algorithm
We will use the term to mean that a painting long = length the longest substring starting position ascending i.If…
Read More
Base conversion: binary, penta, octal, decimal and hexa
#include <stdio.h> #include <stdlib.h> #include <conio.h> static char digit_hexa = "0123456789ABCDEF"; static char digit_decimal = "0123456789"; static char digit_octa =…
Read More
Tie strings – algorithm
Check equality of two strings #include <stdio.h> #include <string.h> #define TRUE 1 #define FALSE 0 #define MAX 100 int egal(char*…
Read More
Sorting – Quick sort algorithm
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of…
Read More
Trees – Traversal Post-order
Check if the current node is empty / null Traverse the left subtree by recursively calling the post-order function. Traverse…
Read More
Trees – Traversal Pre-order
Check if the current node is empty / null Display the data part of the root (or current node). Traverse…
Read More
GREEDY – Scroll horse chess board example
Greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each…
Read More
Graphs – Tree Depth-first search
In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two vertices are…
Read More
Diagram Voronoi
In the simplest case, shown in the first picture, we are given a finite set of points {p1, …, pn}…
Read More
Condensation pivotal determinants calculation method
//Calculul determinantilor cu metoda condensarii pivotale #include <conio.h> #include <iostream> #include <math.h> #include <stdlib.h> using namespace std; double a,b,c; int…
Read More
Sorting – Bubble sort
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to…
Read More
Divide et Impera – Hanoi algorithm
Towers of Hanoi problem – Method Divide et impera BRIEF three rods A, B, C being located in the rod…
Read More
Lists – Example with students
List with students: #include <stdio.h> #include <string.h> #include <malloc.h> #include <ctype.h> #include <conio.h> typedef struct elev{ char* nume; char* prenume;…
Read MoreDisplay 2 crowds
// Afisarea a doua multimi #include<stdio.h> #include<conio.h> void main(void) { int a,b,i,j,n,m ; char c='f'; clrscr(); printf("Nr de elemente din…
Read More
Backtracking – Apartments
An algortithm with apartments persons repartisation: #define _CRT_SECURE_NO_DEPRECATE #include<stdio.h> #include<values.h> #define MAX_APART 20 int n; //nr persoane int pref;//preferinta pers…
Read More