Enter a set of numbers with a pointer, find the largest number among them, and swap the largest numb

#include

main()

int i,a[9],temp,*pmax=0;

for(i=0;i<9;i++) *Array subscripts cannot be crossed * scanf("%d",&a[i]);

if(a[i]>*pmax)*pmax=a[i];

printf("%d",*pmax);*After the comparison is completed, it can be output, if it is placed at the end, the output may not be the maximum*

if(*pmax!=a[0]) *Compare value, not compare address * temp=*pmax;

pmax=a[0];

a[0]=temp;

void main()

int i,a[9],temp,*pmax=&a[0];

for(i=0;i<9;i++)

scanf("%d",&a[i]);

if(a[i]>*pmax)*pmax=a[i];

if(pmax!=&a[0])

temp=*pmax;

pmax=a[0];

a[0]=temp;

printf("%d",*pmax);

The initialization pointer can no longer be defined, and the pointer space cannot be directly assigned, so the space must be requested.

Visually at a loss ......It is recommended that you do not assign a value to the pointer.

for(i=0,*pmax=i;i<10;i++) This one is better, right?

Instead, separate the loop from the input ... ...... with two loops

Your A length is 9, but your loop is 10

Method 1: (Using the Comparative Method).

Method 2: (using the foaming method).

Method 3: (Modular design with functions).

Analysis: Since we talk about swaps, these 15 numbers vary.

The algorithm steps are as follows:

1.Put the integer into the one-dimensional array a;

2.Copy the integer into another array b and sort it by the sorting algorithm to get the second largest number and the second decimal number.

3.The obtained sub-largest and sub-decimal numbers are assigned to x and y, respectively.

4.In array a, x is found and replaced with y, and y is found and replaced by x;

5.Output array a, end.

Corrections are welcome!