Graham – algorithm
Permalink

Graham – algorithm

Fibonacci – recursive algorithm
Permalink

Fibonacci – recursive algorithm

Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and…

Continue Reading →

Graphs – related components(algorithm)
Permalink

Graphs – related components(algorithm)

  To determine connected components we use the method of access   depth of a…

Continue Reading →

Polinom – derivate(algorithm in C)
Permalink

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…

Continue Reading →

Euclid algorithm
Permalink

Euclid algorithm

In mathematics, the Euclidean algorithm, or Euclid’s algorithm, is an efficient method for computing the…

Continue Reading →

Queue – algorithm (Sample 1)
Permalink

Queue – algorithm (Sample 1)

Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is…

Continue Reading →

The longest substring ascending – algorithm
Permalink

The longest substring ascending – algorithm

Base conversion: binary, penta, octal, decimal and hexa
Permalink

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[] =…

Continue Reading →

Tie strings – algorithm
Permalink

Tie strings – algorithm

Check equality of two strings #include <stdio.h> #include <string.h> #define TRUE 1 #define FALSE 0…

Continue Reading →

Sorting – Quick sort algorithm
Permalink

Sorting – Quick sort algorithm

Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method…

Continue Reading →