#include "stdio.h"
#include "stdlib.h"

#define SWAP(A, B) {int t = A; A = B; B = t;}

void bubble_sort(int arr[], int n)
{
    for(int i = n - 1; i >=0; i--)
    {
        for(int j = 0; j < i; j++)
        {
            if(arr[j] > arr[j+1])
                SWAP(arr[j], arr[j+1]);
        }
    }
}

void insert_sort(int arr[], int n)
{
    for(int i = 0; i < n-1; i++)
    {
        for(int j = i+1; j < n; j++)
        {
            if(arr[i] > arr[j])
            {
                SWAP(arr[i], arr[j]);
            }
        }
    }
}

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


int main()
{
    int arr[] = {2, 5, 3, 8, 9, 10, 11, 11, 5,5, 2, 8};
    int arr_2[] = {2, 5, 3, 8, 9, 10, 11, 11, 5,5, 2, 8};
    int n = 12;

    bubble_sort(arr, n);
    insert_sort(arr_2, n);

    print(arr, n);
    print(arr_2, n);

    int num = arr[0], count = 1; int i = 0;
    int max_count = 0;

    while(i < n-1)
    {
        while(arr[i] == arr[i+1] && i < (n-1))
        {
            count++;
            i++;
            printf("%d ", arr[i]);
        }


        if (count > max_count )
        {
            max_count = count;
            num  = arr[i];
            printf("num %d max_count %d \n", num, max_count);
        }
        count = 1;
        i++;
    }

    printf("max_count %d num %d", max_count, num);

    return 0;
}