Week-01, Day-01-solution-swe

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);
    int ara[n];
    for(int i = 0; i < n; i++) {
        scanf("%d", &ara[i]);
    }

    //distinct elements
    int temp, count;

    //sort
    for(int i = 0; i < n; i++) {
        for(int j = i+1; j < n; j++) {
            if(ara[i] > ara[j]) {
                //swap
                temp = ara[i];
                ara[i] = ara[j];
                ara[j] = temp;
            }
        }
    }

    int sz = 0;
    int ara2[n];
    int freq[n];

    //   15 =    1, 1, 1, 2, 2, 3, 3, 3, 3, 3, 4, 5, 7, 7, 7

    for(int i = 0; i < n; ) {
        temp = ara[i];// = 1
        count = 0;
        while(ara[i] == temp) {
            count++;// 3
            i++;// 3
            if(i == n) break;
        }
        ara2[sz] = temp;
        freq[sz] = count;
        sz++;
    }

    printf("size = %d\n", sz);

    for(int i = 0; i < sz; i++) {
        printf("%d -> %d\n", ara2[i], freq[i]);
    }


    return 0;
}