A freshman children, can help to find wrong words.if, pointer array sort code-CodePudding

#include
#include
Char * resort mixes (char * a)
{
Char * end, * start * j * min, t;
Start=a;
While (* +!='\ 0');
End=a - 1;
A=start;
for(; a<=end - 1; +)
{
For (j=a, min=a; j<=end - 1; J++)
{
If (* min> * (j + 1)) min=j + 1;
}
If (min!
=a){
T=* a;
* a=* min;
* min=t;
}
}
Return the start;
}
Int main ()
{
Char a, [100].
Gets (a);
Puts (resort mixes (a));
return 0;
}

CodePudding user response:

Modified as follows, for your reference:

 # include & lt; Stdio. H> 
#include  
Char * resort mixes (char * a) 
{
Char * end, * start * j * min, t; 
Start=a; 
While (* start++!='\ 0'); 
End=start - 1; 
Start=a; 
for(; Start{
For (j=start, min=start; j{
If (* min> * (j + 1)) min=j + 1; 
} 
If (min!=start) 
{
T=* start; 
* start=* min; 
* min=t; 
} 
} 
Return a; 
} 


Int main (int arg c, char * argv []) 
{

Char a, [100]. 
Gets (a); 
Puts (resort mixes (a)); 
system("pause"); 
return 0; 

}