## Graham – algorithm

Graham’s scan is a method of finding the convex hull of a finite set of…

## Fibonacci – recursive algorithm

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

## Graphs – related components(algorithm)

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

## 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…

## Euclid algorithm

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

## Queue – algorithm (Sample 1)

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

## The longest substring ascending – algorithm

We will use the term to mean that a painting long [i] = length…

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