INTERCLASARE
// Program sortare prin interclasare. Datele se gasesc in fisierul SIR.DAT #include<stdio.h> #include<conio.h> #define N…
321 total views, no views today
Algorithms
Algorithms
Overloaded fractions
HEADER FILE class Fractie { public: int numarator,numitor; public: Fractie(int numarator=0,int numitor=1); Fractie Suma(Fractie,Fractie); Fractie…
309 total views, no views today
Graham – algorithm
Graham’s scan is a method of finding the convex hull of a finite set of…
548,783 total views, no views today
Fibonacci – recursive algorithm
Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and…
399,531 total views, no views today
Graphs – related components(algorithm)
To determine connected components we use the method of access depth of a…
393,376 total views, no views today
Polinom – derivate(algorithm in C)
#include<stdio.h> #include<conio.h> int a[20],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[i]); } printf(“Se deriveaza…
410,439 total views, 2 views today
Euclid algorithm
In mathematics, the Euclidean algorithm, or Euclid’s algorithm, is an efficient method for computing the…
410,353 total views, no views today
Queue – algorithm (Sample 1)
Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is…
382,876 total views, no views today
The longest substring ascending – algorithm
We will use the term to mean that a painting long [i] = length…
745,021 total views, no views today
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[] =…
422,617 total views, no views today
Tie strings – algorithm
Check equality of two strings #include <stdio.h> #include <string.h> #define TRUE 1 #define FALSE 0…
386,572 total views, no views today
Sorting – Quick sort algorithm
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method…
59,531 total views, no views today
Trees – Traversal Post-order
Check if the current node is empty / null Traverse the left subtree by recursively…
40,835 total views, 2 views today
Trees – Traversal Pre-order
Check if the current node is empty / null Display the data part of…
40,553 total views, no views today
GREEDY – Scroll horse chess board example
Greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the…
35,391 total views, no views today
Graphs – Tree Depth-first search
In mathematics, and more specifically in graph theory, a tree is an undirected graph in…
34,339 total views, 1 views today
Diagram Voronoi
In the simplest case, shown in the first picture, we are given a finite set…
34,399 total views, no views today
Condensation pivotal determinants calculation method
//Calculul determinantilor cu metoda condensarii pivotale #include <conio.h> #include <iostream> #include <math.h> #include <stdlib.h> using…
33,449 total views, no views today
Sorting – Bubble sort
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly…
30,958 total views, no views today
Divide et Impera – Hanoi algorithm
Towers of Hanoi problem – Method Divide et impera BRIEF three rods A, B, C…
31,382 total views, 2 views today
Lists – Example with students
List with students: #include <stdio.h> #include <string.h> #include <malloc.h> #include <ctype.h> #include <conio.h> typedef struct…
23,217 total views, no views today
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’;…
23,495 total views, no views today
Backtracking – Apartments
An algortithm with apartments persons repartisation: #define _CRT_SECURE_NO_DEPRECATE #include<stdio.h> #include<values.h> #define MAX_APART 20 int…
23,802 total views, no views today