RR(round-robin) 스케줄링 구현

#include 
int all_zero(int *arr, int size)
{
   int i = 0;
   for(i = 0; i < size; i++)
   {
      if(arr[i] != 0)
         return 0;
   }
   return 1;
}
void print_arr(int *arr, int size, int num, int real_count, int when) //0 : before, 1 : after
{
   int i;
   if(when == 0)
      printf("%d 번째, %d index 할당 전 상태 : ", real_count, num);
   else
      printf("%d 번째, %d index 할당 후 상태 : ", real_count, num);

   for(i = 0; i < size; i++)
      printf("%d ", arr[i]);
   printf("\n");

   if(when == 1)
      printf("\n");
}
void main()
{
   int arr[10] = {2, 1, 8, 4, 5, 3, 6, 7, 9, 4};
   int i = 0, size = sizeof(arr)/4, real_count = 1;

   while(1)
   {
      if( all_zero(arr,size) == 1 )
         break;

      while(arr[i%size] == 0)
      {
         i++;
      }
      print_arr(arr, size, i%size, real_count, 0);

      if( arr[i%size] != 0 )
         arr[i%size]--;

      print_arr(arr, size, i%size, real_count, 1);
      i++;
      real_count++;
   
   }
}