UJAN IS DEPRESSED

#include <stdio.h>
#include <stdlib.h>
//Frequency of numbers
int main()
{
    //INPUT
    int n;
    printf("enter the number of inputs: ");
    scanf("%d",&n);
    int a[n];
    printf("\n enter %d numbers\n",n);
    for (int i=0; i<n; i++)
        scanf("%d",&a[i]);
    //SORTING
    for (int i=0;i<n-1;i++)
        for (int j=0; j<n-1-i;j++)
            if(a[j]>a[j+1])
            {
                int k=a[j];
                a[j]=a[j+1];
                a[j+1]=k;
            }
            printf("after sorting\n");
    for (int i=0; i<n; i++)
        printf("%d ",a[i]);

    //finding the number of different inputs
    int m=1;
    for (int i=0,j=a[0]; i<n; i++)
        if (j!=a[i])
            {
                m++;
                j=a[i];
            }
            printf("\n%d individual numbers\n",m);

    //Calculating frequency
    int freq=0,f[m]=0,b[m];
    for (int i=0,l=0; i<n; i+=freq)
        {
            //int k= a[i];
            freq =0;
            b[l]=a[i];
            for (int j=0; j<n; j++)
                if(a[j]==a[i]){
                freq++;
                f[l]=freq;
                l++;}
           printf("there is %d %d's\n",freq,a[i]);
        }/*
    //PRINTING ACCORDING TO THEIR FREQUENCY
    for (int i=0; i<m; i++)
        for (int j=0; j<m-1-i;j++)
            if(/*f[j]!=0 &&*//* f[j]<f[j+1])
            {
                int k=b[j];
                b[j]=b[j+1];
                b[j+1]=k;

                k=f[j];
                f[j]=f[j+1];
                f[j+1]=k;
            }

    for (int i=0; i<m; i++)
        if (f[i]!=0)
    {
        printf("there are %d %d's\n",f[i],b[i]);
    }
    */
    return 0;
}