INTERCLASARE
// Program sortare prin interclasare. Datele se gasesc in fisierul SIR.DAT #include<stdio.h> #include<conio.h> #define N…
2,477 total views, no views today
Algorithms
// Program sortare prin interclasare. Datele se gasesc in fisierul SIR.DAT #include<stdio.h> #include<conio.h> #define N…
2,477 total views, no views today
In algebra, a quadratic equation (from the Latin quadratus for “square“) is any equation that…
1,765 total views, 1 views today
HEADER FILE class Fractie { public: int numarator,numitor; public: Fractie(int numarator=0,int numitor=1); Fractie Suma(Fractie,Fractie); Fractie…
2,041 total views, no views today
Graham’s scan is a method of finding the convex hull of a finite set of…
551,274 total views, no views today
Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and…
401,610 total views, no views today
To determine connected components we use the method of access depth of a…
395,078 total views, 2 views today
#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…
413,383 total views, 1 views today
In mathematics, the Euclidean algorithm, or Euclid’s algorithm, is an efficient method for computing the…
412,509 total views, no views today
Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is…
384,861 total views, no views today
We will use the term to mean that a painting long [i] = length…
746,836 total views, no views today
#include <stdio.h> #include <stdlib.h> #include <conio.h> static char digit_hexa[] = “0123456789ABCDEF”; static char digit_decimal[] =…
424,959 total views, 1 views today
Check equality of two strings #include <stdio.h> #include <string.h> #define TRUE 1 #define FALSE 0…
388,150 total views, 1 views today
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method…
61,574 total views, no views today
Check if the current node is empty / null Traverse the left subtree by recursively…
42,529 total views, no views today
Check if the current node is empty / null Display the data part of…
42,289 total views, no views today
Greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the…
37,361 total views, no views today
In mathematics, and more specifically in graph theory, a tree is an undirected graph in…
35,992 total views, no views today
In the simplest case, shown in the first picture, we are given a finite set…
36,238 total views, no views today
//Calculul determinantilor cu metoda condensarii pivotale #include <conio.h> #include <iostream> #include <math.h> #include <stdlib.h> using…
35,426 total views, no views today
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly…
32,737 total views, no views today
Towers of Hanoi problem – Method Divide et impera BRIEF three rods A, B, C…
35,446 total views, 2 views today
List with students: #include <stdio.h> #include <string.h> #include <malloc.h> #include <ctype.h> #include <conio.h> typedef struct…
24,892 total views, no views today
// 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’;…
25,131 total views, no views today
An algortithm with apartments persons repartisation: #define _CRT_SECURE_NO_DEPRECATE #include<stdio.h> #include<values.h> #define MAX_APART 20 int…
25,501 total views, no views today