#include #include #include #define s sizeof struct Map{ int key, val; }; void insertionSort(int l[], int n){ int i, j, val; for(i = 1; i < n; i++){ val = l[i]; j = i - 1; while (j >= 0 && l[j]>val) l[j+1] = l[j], j = j -1; l[j+1] = val; } } int main() { srand(time(0)); int list[50], lstT[50]; int N = s(list)/s(list[0]); // populate the list with random value for(int i = 0; i < N; i++) list[i] = rand()%9+1; // print original list for(int i = 0; i < N; i++) if(list[i]>=0) printf("%d ", list[i]); // sort our list to be able to find mean etc insertionSort(list, N); // copying original list to lst_tmp for(int i = 0; i < N; i++) lstT[i] = list[i]; // remove duplicate elements from lst_tmp int n = N; for(int i = 0; i < n; i++) for(int j = i+1; j < n; j++) if(lstT[i]==lstT[j]){ for(int k = j; k = mode && map[i].val > 0 && map[i].val < N) mode = map[i].val; // printing the histogram printf("Value\t \t Frequency\n"); for(int i = 0; i < s(lstT)/s(lstT[0]); i++){ for(int j = 0; j < s(lstT)/s(lstT[0]); j++){ if(lstT[i]==map[j].key && map[j].val > 0){ if(map[j].val == mode) printf("%d mode\t", map[j].key); else printf("%d \t", map[j].key); printf("%3d: ", map[j].val); for(int c = 0; c < map[j].val; c++) printf("#"); printf("\n"); } } } return 0; }

list stats