Question

Write a program in C to count the frequency of each element of an array. Test Data: Input the number of elements to be stored in the Array: 3 Input 3 elements in the array: element - 0 : 25 element - 1 : 12 element - 2 : 43 Expected Output : The frequency of all elements of an array : 25 occurs 1 times 12 occurs 1 times 43 occurs 1 times

Answer 1

C Program:

#include <stdio.h>
#define SMALL -10000009
#define SIZE 100000

struct hashNode
{
int key;
int freq;

};
struct hashNode hashArray[SIZE];
void insert(int key)
{

for(int i=0; i<SIZE; i++)
{
///if key is equal to key, increment freq by 1 and return
if(hashArray[i].key==key)
{
hashArray[i].freq++;
return;
}
///if we found any empty location, we insert key there
else if(hashArray[i].key==SMALL)
{
hashArray[i].key=key;
hashArray[i].freq++;
return;
}
///else we iterate through the hasArray
}

}

void printHash()
{
printf("\n\nFrequency of all elemnts are:\n");
for(int i=0; i<SIZE; i++)
{
if(hashArray[i].key==SMALL)
return;
else
{
printf("%d occurs %d times\n",hashArray[i].key,hashArray[i].freq);
}
}
}

void BuildHash()
{

///initialize all the key to SMALL
///freq is set to 0
for(int i=0; i<SIZE; i++)
{
hashArray[i].key=SMALL;
hashArray[i].freq=0;
}
}

int main()
{
///BuidHash is a function that build a simple hash function.
///the size of hash array is SIZE
BuildHash();

int n;
printf("Enter the no of elements: ");
scanf("%d",&n);
printf("\n"); ///input from user

int *arr;
arr=malloc(n);/// dynamic memeory allocation using malloc

///takes input n times
for(int i=0; i<n; i++)
{
printf("Element %d: ",i);
int temp;
scanf("%d,",&temp); ///taking ith elements

insert(temp); ///calling insert function to insert in hash
}

///printHash function prints all the content of the hash built
printHash();

return 0;
}

SCREENSHOT:

I have tried my best to explain all the functionality in the best way. If u still feel difficulty in understanding any portion, feel free to comment down in the comment box.

If this is all you wanted and you find it helpful, please upvote the answer.