Programming

void p_array(int arr[])
 {
   int i;
    int size = sizeof(arr) / sizeof(int);
 //    int size = sizeof (arr) / sizeof (arr[0]);
     for (i = 0; i < size; i++)
         printf("%d ", arr[i]);
     printf("\n");
 }

size = sizeof arr/sizeof(int);
size = sizeof arr /sizeof arr[0];

void p_array(int arr[], int size) {
 ...
}

void p_array(int arr[])
 {
       int *a = arr;
 //    int size = sizeof (arr) / sizeof (arr[0]);
     while(a!=NULL)
        { printf("%d ", *a);a++}

     printf("\n");
 }

1 #include<stdio.h>

3 void qsort(int[], int, int);
4 void p_array(int[]);

6 int main()
{
8    int i;
9   int array[] = { 55, 66, 32, 12, 9, 73, 2, 4, 37, 36 };
10    int len = sizeof(array) / sizeof(int);
11    for (i = 0; i < len; i++)
12    printf("%d ", array[i]);
    printf("\n");
14    p_array(array);

    qsort(array, 0, len - 1);
17    for (i = 0; i < len; i++)
18    printf("%d ", array[i]);
    printf("\n");
    return 0;

}

 23  void qsort(int a[], int left, int right)
{
    int pivot, l, r, temp;

    l = left;
    r = right;
    pivot = a[(left + right) / 2];

    while (l < r) {
    while (a[l] < pivot) {
        ++l;
34          p_array(a);
    }
    while (a[r] > pivot) {
        --r;
38          p_array(a);
    }
    if (l >= r)
        break;
    temp = a[l];
    a[l] = a[r];
    a[r] = temp;
    ++l;
    --r;
47     p_array(a);
    }
    if (l == r) {
    l++;
51      p_array(a);
   }
    if (left < r) {
    qsort(a, left, l - 1);
55      p_array(a);
    }
    if (l < right) {
    qsort(a, r + 1, right);
59      p_array(a);
    }
60    p_array(a);
}

63 void p_array(int arr[])
{
    int i;
66    int size = sizeof(arr) / sizeof(int);
//    int size = sizeof (arr) / sizeof (arr[0]);
    for (i = 0; i < size; i++)
    printf("%d ", arr[i]);
    printf("\n");
}

55 66 32 12 9 73 2 4 37 36 // this from line 10 ~ 12, which is correct
55 66 
2 4 
...
2 4 
2 4 9 12 32 36 37 55 66 73 // this from line 17 ~ 18 which is also correct