I need help finding the big O run time of these 2 functions

I need help finding the big O run time of these 2 functions, dont understand how to do so.

void printPowerset (intn, int *bestSet, int &bestsize;, float *A) int *stack, k; stack = new int [n + 1]; stack[0] = 0; k=0; while (1) [ if (stack[k]

Solution

for the first function printpowerset O(n)

because in while loop it is running maximum n times

for second function checkset O(k)

it is ruunin maximum k iterations