11.

Write a C program to count frequency of each

element in an array.

#include<stdio.h>
#include<conio.h>
void main()
{
int arr[50],freq[100];
int i,j,count,size;
printf("enter size of array");
scanf("%d",&size);
printf("Enter array elements:");
for(i=0;i<size;i++)
{
scanf("%d",&arr[i]);

freq[i] = -1;
}

for(i=0; i<size; i++)

{
count = 1;
for(j=i+1; j<size; j++)
{
if(arr[i]==arr[j])
{
count++;

freq[j] = 0;
}
}

if(freq[i] != 0)
{
freq[i] = count;
}
}
printf("\nFrequency of all elements of array : \n");
for(i=0; i<size; i++)
{
if(freq[i] != 0)
{
printf("%d occurs %d times\n", arr[i], freq[i]);
}
}

getch();
}
12. Write a C program to print all unique elements
in the array.

#include <stdio.h>
#include<conio.h>
void main()
{
int arr[MAX_SIZE], freq[MAX_SIZE];
int size, i, j, count;
printf("Enter size of array: ");
scanf("%d", &size);
printf("Enter elements in array: ");
for(i=0; i<size; i++)
{
scanf("%d", &arr[i]);
freq[i] = -1;
}

for(i=0; i<size; i++)

{
count = 1;
for(j=i+1; j<size; j++)
{
if(arr[i] == arr[j])
{
count++;
freq[j] = 0;
}
}

if(freq[i] != 0)
{
freq[i] = count;
}
}
printf("\nUnique elements in the array are: ");
for(i=0; i<size; i++)
{
if(freq[i] == 1)
{
printf("%d ", arr[i]);
}
}

getch();
}
13. Write a C program to count total number of
duplicate elements in an array.

#include <stdio.h>

#include<conio.h>

void main()
{
int arr[MAX_SIZE];
int i, j, size, count = 0;
printf("Enter size of the array : ");
scanf("%d", &size);

printf("Enter elements in array : ");

for(i=0; i<size; i++)
{
scanf("%d", &arr[i]);
}

for(i=0; i<size; i++)

{
for(j=i+1; j<size; j++)
{
/* If duplicate found then increment count by 1 */
if(arr[i] == arr[j])
{
count++;
break;
}
}
}

printf("\nTotal number of duplicate elements found in array = %d",

count);

getch();
}
14. Write a C program to delete all duplicate elements from an
array.
#include <stdio.h>

#include<conio.h>

int main()
{
int arr[MAX_SIZE];
int size;
int i, j, k;

printf("Enter size of the array : ");

scanf("%d", &size);

printf("Enter elements in array : ");

for(i=0; i<size; i++)
{
scanf("%d", &arr[i]);
}

for(i=0; i<size; i++)

{
for(j=i+1; j<size; j++)
{
if(arr[i] == arr[j])
{

for(k=j; k<size; k++)

{
arr[k] = arr[k + 1];
}

size--;
j--;
}
}
}

printf("\nArray elements after deleting duplicates : ");

for(i=0; i<size; i++)
{
printf("%d\t", arr[i]);
}

getch();
}
15. Write a C program to merge two array to third array.
#include <stdio.h>
#include<conio.h>

int main()
{
int arr1[MAX_SIZE], arr2[MAX_SIZE], mergeArray[MAX_SIZE * 2];
int size1, size2, mergeSize;
int index1, index2, mergeIndex;
int i;

printf("Enter the size of first array : ");

scanf("%d", &size1);

printf("Enter elements in first array : ");

for(i=0; i<size1; i++)
{
scanf("%d", &arr1[i]);
}

printf("\nEnter the size of second array : ");

scanf("%d", &size2);

printf("Enter elements in second array : ");

for(i=0; i<size2; i++)
{
scanf("%d", &arr2[i]);
}

mergeSize = size1 + size2;

index1 = 0;
index2 = 0;
for(mergeIndex=0; mergeIndex < mergeSize; mergeIndex++)
{

if(index1 >= size1 || index2 >= size2)

{
break;
}

if(arr1[index1] < arr2[index2])

{
mergeArray[mergeIndex] = arr1[index1];
index1++;
 }
else
{
mergeArray[mergeIndex] = arr2[index2];
index2++;
}
}

while(index1 < size1)

{
mergeArray[mergeIndex] = arr1[index1];
mergeIndex++;
index1++;
}
while(index2 < size2)
{
mergeArray[mergeIndex] = arr2[index2];
mergeIndex++;
index2++;
}

printf("\nArray merged in ascending order : ");

for(i=0; i<mergeSize; i++)
{
printf("%d\t", mergeArray[i]);
}

getch();
}

16. Write a C program to find reverse of an array.

#include <stdio.h>
#include<conio.h>

int main()
{
int arr[MAX_SIZE];
int size, i;

printf("Enter size of the array: ");

scanf("%d", &size);
printf("Enter elements in array: ");
for(i=0; i<size; i++)
{
scanf("%d", &arr[i]);
}

printf("\nArray in reverse order: ");

for(i = size-1; i>=0; i--)
{
 printf("%d\t", arr[i]);
}

getch();

17. Write a C program to put even and odd elements of array in

two separate array.

#include<stdio.h>

#include<conio.h>
void printArray(int arr[], int len);

void main()
{
int arr[MAX_SIZE];
int even[MAX_SIZE], odd[MAX_SIZE];

int evenCount, oddCount;

int i, size;
printf("Enter size of the array: ");
scanf("%d", &size);
printf("Enter elements in the array: ");
for(i=0; i<size; i++)
{
scanf("%d", &arr[i]);
}

evenCount = 0;
oddCount = 0;

for(i=0; i<size; i++)

{

if(arr[i] & 1)
{
odd[oddCount] = arr[i];
oddCount++;
}
else
{
even[evenCount] = arr[i];
evenCount++;
}
}

printf("\nElements of even array: \n");

printArray(even, evenCount);
 printf("\nElements of odd array: \n");
printArray(odd, oddCount);

getch();
}

18. Write a C program to search an element in an array.

#include <stdio.h>
#include<conio.h>

int main()
{
int arr[MAX_SIZE];
int size, i, toSearch, found;
printf("Enter size of array: ");
scanf("%d", &size);

printf("Enter elements in array: ");

for(i=0; i<size; i++)
{
scanf("%d", &arr[i]);
}

printf("\nEnter element to search: ");

scanf("%d", &toSearch);

found = 0;

for(i=0; i<size; i++)

{

if(arr[i] == toSearch)
{
found = 1;
break;
}
}

if(found == 1)
{
printf("\n%d is found at position %d", toSearch, i + 1);
}
else
{
printf("\n%d is not found in the array", toSearch);
}

getch();
}
19. Write a C program to sort array elements in ascending or
descending order.
#include<stdio.h>
#include<conio.h>
int main()
{
int arr[MAX_SIZE];
int size;
int i, j, temp;
printf("Enter size of array: ");
scanf("%d", &size);

printf("Enter elements in array: ");

for(i=0; i<size; i++)
{
scanf("%d", &arr[i]);
}

for(i=0; i<size; i++)

{

for(j=i+1; j<size; j++)

{

if(arr[i] > arr[j])

{
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}

printf("\nElements of array in ascending order: ");

for(i=0; i<size; i++)
{
printf("%d\t", arr[i]);
}

getch();
}

20. Write a C program to sort even and odd elements of array

separately.
#include <stdio.h>
#include <limits.h>
#include<conio.h>
#define MAX_SIZE 1000
 void arrange(int arr[], int len, int pivot);
void sort(int arr[], int start, int end);
void print(int arr[], int len);

int main()
{
int arr[MAX_SIZE], i, n;
int pivot, evenCount, oddCount;

pivot = 0;
evenCount = oddCount = 0;

printf("Enter size of the array: ");

scanf("%d", &n);
printf("Enter elements in the array: ");
for(i=0; i<n; i++)
{
scanf("%d", &arr[i]);

if(arr[i] & 1)
oddCount++;
else
evenCount++;
}
pivot = (evenCount > oddCount) ? evenCount : oddCount;

print(arr, n);

arrange(arr, n, pivot);

printf("\nElements after arranging even and odd elements separately\n");

print(arr, n);

sort(arr, pivot, n);

sort(arr, 0, pivot);

printf("\nFinal array after sorting even and odd elements separately\n");

print(arr, n);

getch();
}