Simple selection sort sort of common language C

#include<stdio.h>

void SimpleSelectSort(int *ArrayBuf,int ArrayLength)
{
 int i,j,min,temp;

 for(i = 0; i < ArrayLength-1; i++)
 {
  min = i;

  for(j = i+1; j < ArrayLength; j++)
  {
   if(ArrayBuf[j] < ArrayBuf[min])
   {
    min = j;
   }
  }

  if(min != i)
  {
   temp = ArrayBuf[min];
   ArrayBuf[min] = ArrayBuf[i];
   ArrayBuf[i] = temp;
  }

  for(int k = 0; k< ArrayLength; k++)
  {
   printf("%d ",ArrayBuf[k]);
  }

  printf("\r\n");

 }

 
}

int main(void)
{

 int Array[5] = {4,2,1,3,0};

 SimpleSelectSort(&Array[0],5);

 return 0;
}

 

Note: Simple selection sort Bubble sort principle similar to each trip to find a maximum or minimum value, N need to compare the number of times N-1.