qsort int array 2

#include <stdio.h>      /* printf */
#include <stdlib.h>     /* qsort, bsearch, NULL */

int sumuj( int *A,int size)
{
    int suma=0;
    for (int i=0;i<size;i++)
    {
        suma=suma+A[i];
    }
    return suma;
}
int compare (const void *a, const void *b)
{
    //const int *aa = *(const int **)a;
    //const int *bb = *(const int **)b;
    return (sumuj(a,3)-sumuj(b,3));

}

 int main()
 {
     int array[][3]={{1,2,3},{7,8,9},{4,5,6}};
     printf("compare = %d\n\n",sizeof(array[0]));
    printf("qsort = %d %d %d\n",array[0][0],array[1][0],array[2][0]);
     qsort(array, sizeof(array)/sizeof(array[0]),sizeof(array[0]),compare);
     qsort((void*)array, 3,sizeof(int*),compare);


     printf("qsort = %d %d %d",array[0][0],array[1][0],array[2][0]);
     return 0;
 }