C pointer exercise-select sorting

# Include <stdio. h>
 Void Print_result ( Float *, Int );
 Void Select_sort ( Float *, Int );

 Int Main ()
{
 Int I;
 Float Array [ 10 ];
Float * Pointer;
Printf ( "  Enter 10 numbers: \ n  " );
 For (I = 0 ; I < 10 ; I ++)
{
Scanf ( "  % F  " , & Array [I]);
}
Pointer = array;
Select_sort (pointer,10 );
Print_result (pointer, 10 );


 Return   0 ;
}

 Void Print_result ( Float * P, Int N)
{ //  Output result  
      Int K;
For (K = 0 ; K <n; k ++)
{
Printf ( "  % G \ t  " , * (P + k ));
}
}

 Void Select_sort ( Float * PT, Int N)
{ //  Sort all pointer Selection  
      Int I, J, K;
 Float Tempnum;

 For (I = 0 ; I <n; I ++ ){
K = I;
 For (J = I + 1 ; J <n; j ++)
{
 If (* (Pt + J)> * (Pt + I ))
{
K = J;
}
}
Tempnum = * (Pt + I );
* (Pt + I) = * (Pt + k );
* (Pt + k) = tempnum;
}
}

Configure a previous image andCode:

 ///  /======================================  
  Void Selectsort ( Int Arr [], Int N)
{
Printf ( "  \ N select sorting process: \ n  " );
Int I, J, K, L, T;
 For (I = 0 ; I <n; I ++)
{
K = I;
 For (J = I + 1 ; J <n; j ++)
{
 If (ARR [J] <arr [k])
{
K = J;
}

}
 If (K! = I)
{
T = arr [I]; arr [I] = arr [k]; arr [k] = T;
}
 For (L = 0 ; L <n; l ++)
{
Printf ( "  % 3C  " , Arr [l]);
}

Printf ( "  \ N  " );
}
}