sorting algorithms process output! NEED HELP!

[supahnonymous]

CAN ANYONE HELP ME CONVERT THIS CODE TO OUTPUT THE PROCESS OF INSERTION AND SELECTION SORT. SO THAT I CAN COMPARE OR STUDY THE CODES.

int num, arr[1000], i, j,k, temp;

printf("\nEnter no of elements :");
scanf("%d", &num);

printf("\nEnter array elements :");
for (i = 0; i < num; i++)
scanf("%d",&arr[i]);


printf("\nUnsorted Data:");
for (k=0;k<num;k++) {
printf("%5d",arr[k]);
}

for (i=1;i<num;i++) {
for (j=0;j<num-1;j++) {
if (arr[j]>arr[j+1]) {
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}

printf("\nAfter pass %d : ", i);
for (k=0;k<num;k++) {
printf("%5d",arr[k]);
}
}

[Thomas1965]

Do you mean like this?

Enter no of elements :5

Enter array elements :4
3
2
1
0

Unsorted Data:    4    3    2    1    0
i=1     j=0 :     3    4    2    1    0
i=1     j=1 :     3    2    4    1    0
i=1     j=2 :     3    2    1    4    0
i=1     j=3 :     3    2    1    0    4
i=2     j=0 :     2    3    1    0    4
i=2     j=1 :     2    1    3    0    4
i=2     j=2 :     2    1    0    3    4
i=2     j=3 :     2    1    0    3    4
i=3     j=0 :     1    2    0    3    4
i=3     j=1 :     1    0    2    3    4
i=3     j=2 :     1    0    2    3    4
i=3     j=3 :     1    0    2    3    4
i=4     j=0 :     0    1    2    3    4
i=4     j=1 :     0    1    2    3    4
i=4     j=2 :     0    1    2    3    4
i=4     j=3 :     0    1    2    3    4

for (i = 1; i<num; i++)
{
  for (j = 0; j<num - 1; j++)
  {
    if (arr[j]>arr[j + 1])
    {
      temp = arr[j];
      arr[j] = arr[j + 1];
      arr[j + 1] = temp;
    }
    printf("\ni=%d\tj=%d : ", i, j);
    for (k = 0; k<num; k++)
    {
      printf("%5d", arr[k]);
    }
  }
}