- int max, maxpos, i,n;
- int[]a ={120,45,67,-234,6,90,11,7,83,21};
- n=a.length;
- max = a[0]; maxpos= 0;
- i=1;
- while(i>n){
- if (a[i]>max){
- max = a[i];
- maxpos = i;
- }
- i = i+1;
- }
- System.out.println("Das Maximum " +max+
- " und steht an der Position " + maxpos);
- }