what is the complexity of my C program?

[szpengchao]

#include <stdio.h>

main(){
  int ele,in,data[12],p,k;
  printf("enter your value for prime p:");
  scanf("%d",&p);
  for(ele=1;ele<=p-1;ele++){
    for(in=1;in<=p-1;in++){
      if(ele*in%p==1){
	data[ele]=in;
      }
    }
  }
 print: printf("Enter the element you want to check:\n"); 
  fflush(stdout);
  scanf("%d",&k);
  printf("Its inverse is: %d\n",data[k]); 
  goto print;
}

what's the complexity of this program in terms of variable 'p'?
give a simple function f(p) of p, such as pp, p or 2p, such that the number of
steps is O(f(p)), meaning of the order of magnitude of f(p). To be exact, a function
g(p) is O(f(p)) if there are positive constants c and C such that c <= g(p)/f(p) <= C for all sufficiently large p

[noops]

This is not a C programming question.

[anon]

That program is a little broken. That array will contain lots of uninitialized values and the bounds checking is the user's responsibility, not to mention unneccessary use of goto, where a simple while(1) would be less to type and convey more info about the intention of the loop.

[QuantumPete]

we don't do your homework for you!

QuantumPete

[Salem]

Since you have data[12], a sufficiently large p creates it's own set of problems.

[iMalc]

You used a goto and you didn't explicitly make main return int
FAIL!

[robwhit]

Doesn't matter since the end is never reached.

[dwks]

ele<=p-1

What's wrong with this?

ele < p