INTERCLASARE
// Program sortare prin interclasare. Datele se gasesc in fisierul SIR.DAT #include<stdio.h> #include<conio.h> #define N…
2,291 total views, 1 views today
Algorithms
// Program sortare prin interclasare. Datele se gasesc in fisierul SIR.DAT #include<stdio.h> #include<conio.h> #define N…
2,291 total views, 1 views today
In algebra, a quadratic equation (from the Latin quadratus for “square“) is any equation that…
1,578 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…
1,849 total views, no views today
Graham’s scan is a method of finding the convex hull of a finite set of…
550,996 total views, 1 views today
Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and…
401,417 total views, no views today
To determine connected components we use the method of access depth of a…
394,888 total views, no 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,195 total views, 2 views today
In mathematics, the Euclidean algorithm, or Euclid’s algorithm, is an efficient method for computing the…
412,316 total views, no views today
Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is…
384,673 total views, no views today
We will use the term to mean that a painting long [i] = length…
746,647 total views, no views today
#include <stdio.h> #include <stdlib.h> #include <conio.h> static char digit_hexa[] = “0123456789ABCDEF”; static char digit_decimal[] =…
424,730 total views, no views today
Check equality of two strings #include <stdio.h> #include <string.h> #define TRUE 1 #define FALSE 0…
387,970 total views, no views today
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method…
61,382 total views, no views today
Check if the current node is empty / null Traverse the left subtree by recursively…
42,329 total views, no views today
Check if the current node is empty / null Display the data part of…
42,124 total views, 1 views today
Greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the…
37,172 total views, no views today
In mathematics, and more specifically in graph theory, a tree is an undirected graph in…
35,830 total views, no views today
In the simplest case, shown in the first picture, we are given a finite set…
36,042 total views, no views today
//Calculul determinantilor cu metoda condensarii pivotale #include <conio.h> #include <iostream> #include <math.h> #include <stdlib.h> using…
35,237 total views, no views today
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly…
32,526 total views, 1 views today
Towers of Hanoi problem – Method Divide et impera BRIEF three rods A, B, C…
35,168 total views, no views today
List with students: #include <stdio.h> #include <string.h> #include <malloc.h> #include <ctype.h> #include <conio.h> typedef struct…
24,682 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’;…
24,972 total views, 1 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,316 total views, no views today