Merge of two arrays in C - DS TUTORIAL - onwnxcvnne
Headlines News :
Home » , , » Merge of two arrays in C - DS TUTORIAL

Merge of two arrays in C - DS TUTORIAL

Written By jomon on Monday 16 April 2012 | 08:55

how to merge two array in c language. There are four function in this given example one for reading the array element, second for writing on console and third for sorting of both array and last for merge of two array into one.

Code:

#include<stdio.h>
#include<conio.h>
void main()
{

void
read(int *,int);
void
display(int *,int);
void
sort(int *,int);
void
mergelist(int *,int *,int *,int);
int
a[5],b[5],c[10];
clrscr();
printf("Enter the elements for the first array \n");
read(a,5);
printf("The elements of first array are : \n");
display(a,5);
printf("Enter the elements for the second array \n");
read(b,5);
printf("The elements of second array are : \n");
display(b,5);
sort(a,5);
printf("The sorted first array in decending order are :\n");
display(a,5);
sort(b,5);
printf("The sorted second array in decending order are :\n");
display(b,5);

mergelist(a,b,c,5);
printf("The elements of merged list is \n");
display(c,10);
getch();
}

void
read(int c[],int i)
{

int
j;
for
(j=0;j<i;j++)
scanf("%d",&c[j]);
}

void
display(int d[],int i)
{

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

void
sort(int arr[] ,int k)
{

int
temp;
int
i,j;
for
(i=0;i<k;i++)
{

for
(j=0;j<k-i-1;j++)
{

if
(arr[j]<arr[j+1])
{

temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
}


void
mergelist(int a[],int b[],int c[],int k)
{

int
ptra=0,ptrb=0,ptrc=0;
while
(ptra<k && ptrb<k)
{

if
(a[ptra] < b[ptrb])
{

c[ptrc]=b[ptrb];
ptrb++;
}

else

{

c[ptrc]=a[ptra];
ptra++;
}

ptrc++;
}

while
(ptra<k)
{

c[ptrc]=a[ptra];
ptra++;ptrc++;
}

while
(ptrb<k)
{

c[ptrc]=b[ptrb];
ptrb++; ptrc++;

}
}

Output:



Previous - Inverse of an array in C

     Next - Overview of Linked List

 Data Structure Tutorial 

1.  Introduction to Data Structures
2.  Pointer in C 
3.  Pointer and Structure in C
4.  Linear and Non-Linear Data Structure in C
5.  Array Implementation in C
6.  Sum of array element in C
7.  Addition of two arrays element in C
8.  Inverse of an array in C
9.  Merge of two arrays in C 
10.Overview of Linked List
11.Singly Linked List
12.Doubly Linked List
13.Circular Linked List
14.Count number of nodes
15.Split a list into two equal size list
16.Merge two list into a single list
17.Stack
18.Push and Pop operation of stack.
19.Push and Pop operation of stack using linked list.
20.Queue implementation using array.
21.Queue implementation using linked list.
22.Circular queue implementation using array.
23.Tree data structure
24.Representing Graph using adjacency list & perform DFS & BFS
Share this article :

0 comments:

Speak up your mind

Tell us what you're thinking... !

 
Support : Creating Website | Johny Template | Mas Template
Copyright © 2011. onwnxcvnne - All Rights Reserved
Template Created by Creating Website Published by Mas Template
Proudly powered by Blogger