int findlargest(int number[],int from, int to)

{

int myguess=from;

for(int i=from;i<=to;i++)

{

if(number[myguess]<number[i]) myguess=i;

}

return myguess;

}

returns the position where the largest element is found!