You are on page 1of 1

coada-functii

bool isEmpty(int k) {
if(k == 0)
return true;
return false;
}

void push(int coada[], int &k, int numar) {


k = k + 1;
coada[k] = numar;
}

int front(int coada[]) {


return coada[1];
}

int pop(int coada[], int &k) {


int rezultat = coada[1];
for(int i = 1; i < k - 1; i++)
coada[i] = coada[i + 1];
k = k - 1;
return rezultat;
}

You might also like