1. Find a number subscript
#include <stdio.h>intMainintargcConst Char*argv[]) { inta[Ten]={3,2,0,4,5,8,9,7,6,1}; intA1; intI=0; printf ("Please enter a value:"); scanf ("%d",&A1); for(; i<Ten; i++) { if(a[i]==A1) printf ("%d", i); } return 0;}
2. Find the subscript value corresponding to the largest element of the array
#include <stdio.h>intMainintargcConst Char*argv[]) { inta[Ten],i; intmax,b=0; for(i=0;i<Ten; i++) scanf ("%d",&A[i]); Max=a[0]; for(i=1;i<Ten; i++) { if(a[i]>max) {Max=A[i]; b=i; }} printf ("maximum value is:%d", Max); printf ("Subscript is:%d", B); return 0;}
3. Two-d array subscript values
#include <stdio.h>intMainintargcConst Char*argv[]) { inta[5][5],max,h,l,i,j; printf ("Please input numbers:\n"); for(i=0;i<5; i++) for(j=0;j<5; j + +) scanf ("%d",&A[i][j]); Max=a[0][0]; for(i=0;i<5; i++) for(j=0;j<5; j + +) if(a[i][j]>max) {Max=A[i][j]; H=i; L=J; } printf ("The max number is:%d,h=%d,l=%d", max,h,l); GetChar (); return 0;}
C Language Lookup Method-array subscript