INTERCLASARE
// Program sortare prin interclasare. Datele se gasesc in fisierul SIR.DAT #include<stdio.h> #include<conio.h> #define N…
2,338 total views, 2 views today
Algorithms
// Program sortare prin interclasare. Datele se gasesc in fisierul SIR.DAT #include<stdio.h> #include<conio.h> #define N…
2,338 total views, 2 views today
In algebra, a quadratic equation (from the Latin quadratus for “square“) is any equation that…
1,626 total views, no views today
HEADER FILE class Fractie { public: int numarator,numitor; public: Fractie(int numarator=0,int numitor=1); Fractie Suma(Fractie,Fractie); Fractie…
1,900 total views, no views today
Graham’s scan is a method of finding the convex hull of a finite set of…
551,080 total views, 1 views today
Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and…
401,462 total views, no views today
To determine connected components we use the method of access depth of a…
394,934 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,244 total views, 2 views today
In mathematics, the Euclidean algorithm, or Euclid’s algorithm, is an efficient method for computing the…
412,363 total views, no views today
Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is…
384,724 total views, 1 views today
We will use the term to mean that a painting long [i] = length…
746,692 total views, 1 views today
#include <stdio.h> #include <stdlib.h> #include <conio.h> static char digit_hexa[] = “0123456789ABCDEF”; static char digit_decimal[] =…
424,775 total views, 1 views today
Check equality of two strings #include <stdio.h> #include <string.h> #define TRUE 1 #define FALSE 0…
388,017 total views, 3 views today
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method…
61,431 total views, 1 views today
Check if the current node is empty / null Traverse the left subtree by recursively…
42,376 total views, 1 views today
Check if the current node is empty / null Display the data part of…
42,166 total views, 1 views today
Greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the…
37,221 total views, 1 views today
In mathematics, and more specifically in graph theory, a tree is an undirected graph in…
35,866 total views, no views today
In the simplest case, shown in the first picture, we are given a finite set…
36,082 total views, 1 views today
//Calculul determinantilor cu metoda condensarii pivotale #include <conio.h> #include <iostream> #include <math.h> #include <stdlib.h> using…
35,284 total views, no views today
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly…
32,579 total views, no views today
Towers of Hanoi problem – Method Divide et impera BRIEF three rods A, B, C…
35,229 total views, 1 views today
List with students: #include <stdio.h> #include <string.h> #include <malloc.h> #include <ctype.h> #include <conio.h> typedef struct…
24,730 total views, 1 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,009 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,362 total views, 2 views today