In Big- notation, analyze the amortized running time of the following code/pseudo-code. Describe it as a function of the input size (here, n).

int n; // Set to some large value initially int* A; // Points to an array of size n int x = n; // Suppose x & n are only changed by this function int f1(int* A) { if( x == 0) { x = n; return 1; } else if( (x % (int)sqrt(n)) == 0){ for(int i=1; i <= n; i++){ for(int j = 0; j < i; j++){ // do something O(1) with A[] // x and n are unaffected } } } else { // do something O(1) // x and n are unaffected } x--; return 0; }