C ++ masters help, give an answer

myjinx

Record the position of the maximum and minimum values, and then exchange with the head and tail
How to write only the largest and smallest?
Big brother upstairs, thank you in advance.

冥冥中

No bubble sorting is required. Just traverse twice, find the largest one the first time, swap with the first element, find the smallest the second time, and swap the last element,

myjinx

55555555555555
I want code, urgent use! ! !
A big brother above told me the code in descending order.

冥冥中

It can also be traversed at once, two together
int mint=a[0],maxt = a[0];
for(int i = 0; i <sizeof(a)/sizeof(int); ++i)
{
   if(maxt <a[i])
     //.......;
   if(mint> a[i])
     //........;
}

冥冥中

Exchange the two.
Then at the end, give maxt to the first and mint to the last, and it’s ok,
You have to write a little by yourself?

se7en1984

int maxIndex=0;//Maximum position
int minIndex=0;//The minimum position
int maxArray=array[0];
int minArray=array[0];

for(int i=1;i<len;i++)
{
  if(maxArray<array[i])
  {
   maxArray=array[i];
   maxIndex=i;
  }
  if(minArray>array[i])
  {
   minArray=array[i];
   mixIndex=i;
  }
}

int tmpInt=array[0];
array[0]=array[maxIndex];
array[maxIndex]=tmpInt;

tmpInt=array[len-1];
array[len-1]=array[minIndex];
array[maxIndex]=tmpInt;

sun88888

Ha ha, you must be a novice
The two lines above are:
if(maxt<a[i])
  maxt = a[i];
if(mint>a[i])
  mint = a[i];

Finally, assign maxt to a[0] and mint to a[9]

冥冥中

It’s better to exchange, so that the array itself is destroyed

sun88888

Sorry, the above is wrong
Not just assignment, but exchange

se7en1984

int maxIndex=0;//Maximum position
int minIndex=0;//The minimum position
int maxArray=array[0];
int minArray=array[0];

for(int i=1;i<len;i++)
{
  if(maxArray<array[i])
  {
   maxArray=array[i];
   maxIndex=i;
  }
  if(minArray>array[i])
  {
   minArray=array[i];
   mixIndex=i;
  }
}

int tmpInt=array[0];
array[0]=array[maxIndex];
array[maxIndex]=tmpInt;

tmpInt=array[len-1];
array[len-1]=array[minIndex];
array[minIndex]=tmpInt;//Typographical error here, changed! ! !

The idea is to write down the position of the maximum and minimum value, and finally exchange

Does this fit your meaning?