EURO INFORMATICA & EURO ELECTRONICA – TECHSOUP
Permalink

EURO INFORMATICA & EURO ELECTRONICA – TECHSOUP

EURO INFORMATICA & EURO ELECTRONICA Evenimentul este finanțat cu ajutorul inițiativei Meet and Code (https://www.meet-and-code.org/)…

Continue Reading →

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 →

JavaScript Comments
Permalink

JavaScript Comments

JavaScript comments can be used to make the code more readable. JavaScript Comments Comments will…

Continue Reading →

CSS Introduction
Permalink

CSS Introduction

What You Should Already Know Before you continue you should have a basic understanding of…

Continue Reading →

Java – Modifier Types and Basic Operators
Permalink

Java – Modifier Types and Basic Operators

Modifiers are keywords that you add to those definitions to change their meanings. Java language…

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 →