Sort by rows summ

#include <stdio.h>
#include <math.h>
#define SIZE 5
//uporjadochit stroki po vozrastaniju summy ix elementov
//NOT COMPLETED!!!

void pop_arr(int s,int a[s][s]);
void pr_arr(int s,int a[s][s]);
void calc_row(int s,int a[s][s],int m[s]);//

int main()
{
    int min[SIZE],arr [SIZE][SIZE];
    pop_arr(SIZE,arr);
    pr_arr(SIZE,arr);
    calc_row(SIZE,arr,min);

    return 0;
}
void pop_arr(int s,int a[s][s])
{
   int i,j;
   for(i=0;i<s;i++)
   {
       for(j=0;j<s;j++)
          a[i][j]=rand()%20;
   }
}

void pr_arr(int s,int a[s][s])
{
    int i,j;
    for(i=0;i<s;i++)
    {
        for(j=0;j<s;j++)
        {printf("%d\t",a[i][j]);}
        printf("\n");
    }
}

void calc_row(int s,int a[s][s],int summa[s])
{
    int i,j,summ,index=0;//biggest summ in row index
    for(i=0;i<s;i++)
    {
        summ=0;
        for(j=0;j<s;j++)//summarises each row, puts summ into m[i] for each row
            summ+=a[i][j];
        summa[i]=summ;
    }
    for(i=0;i<s;i++)//prins summ for each row
        printf("summ - %d\n",summa[i]);

    for(i=0;i<s;i++)//finds row with the biggest summ for it(which row is the heaviest?)
        index =(summa[i]>summa[index])? i:index;
    printf("index is %d,summ is %d\t",index,summa[index]);
}
void sort_arr(int s,int a[s][s],int summa[s])
{
    int i,j,order[s],min=100000;//order of row indexes
    for(i=0;i<s;i++)
    {
        for(j=0;j<s;j++)
        {

        }
    }
}