PHAnalyze the program below and fill the output order on each loop on each pass given int a[]={7,3,66,3,-5,22,-77,2} as initial data order. (35 pts)
void swap(int *p, int *q)
{
int tmp;
tmp = *p;
*p = *q;
*q = tmp;
}
void bubble(int a[], int n)
{
int i, j;
for(i = 0 ; i < n – 1 ; i++)
for(j = n – 1 ; i < j ; j--)
if(a[j – 1] > a[j])
swap(&a[j – 1], &a[j]);
}
void swap(int *p, int *q)
{
int tmp;
tmp = *p;
*p = *q;
*q = tmp;
}
void bubble(int a[], int n)
{
int i, j;
for(i = 0 ; i < n – 1 ; i++)
for(j = n – 1 ; i < j ; j--)
if(a[j – 1] > a[j])
swap(&a[j – 1], &a[j]);
}