Arrays and Data Structures in C++

8/14/2019 Arrays and Data Structures in C++

http://slidepdf.com/reader/full/arrays-and-data-structures-in-c 1/23

PROGRAM 1 Write a C++ program to store an ARRAY of 10 numbers and implement LINEAR SEARCH .

#include<iostream.h>

#include<conio.h>

int Linear_Search(int a[],int MAX,int item)

{ int x=‐1;

for(int i=0;i<MAX;i++)

if(a[i]==item)

return i;

return x;

}

const int MAX=5;

void main()

{ clrscr();

int a[MAX],i,j,x,item;

cout<<"Enter the contents of the Array: \n\n";

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

cin>>a[i];



cout<<"\n\nThe contents of the array are\n\n:";

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

cout<<a[i]<<"\t"; cout<<"\n";

cout<<"\n\nEnter the item to be searched:\n";

cin>>item;

x=Linear_Search(a,MAX,item);

if(x>‐1)

cout<<"\n\nThe item is found at "<<x+1;

else

cout<<"\n\nThe Item is not in the array.";

getch();

}



PROGRAM 2 Write a C++ program to store an ARRAY of 10 numbers and implement BINARY SEARCH .


#include<conio.h>

int Binary_Search (int a[], int MAX, int item)

{ int beg=0, last=MAX, mid, x=‐1;

while (beg<last)

{ mid = (beg + last)/2;

If (a[mid]==item)

return mid;

else if (a[mid]<item)

beg = mid+1;

else

last = mid‐1;

}

return x;

}

const int MAX = 10;



void main()

{ clrscr();

int a[MAX], i, j, x, item;

cout<<"Enter the contents of the Array (In ascending Order):\n\n";

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

cin>>a[i];


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


cout<<"\n\nEnter the item to be searched:\n";

cin>>item;

x = Binary_Search(a, MAX, item);

if (x>‐1)

cout<<"\n\nThe item is found at "<<x+1;

else

cout<<"\n\nThe Item is not in the array.";

getch();

}



PROGRAM 3 Write a C++ program to store an ARRAY of 10 numbers and implement BUBBLE SORT .


#include<conio.h>

const int MAX=10;

void main()

{ clrscr();

int a[MAX],i,j,x=1,t;

cout<<"Enter the contents of the Array:";

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

cin>>a[i];


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


for(i=1;i<=MAX;i++)

{ for(j=0;j<MAX‐1;j++)

{ if(a[j]>a[j+1])

{ t=a[j];



a[j]=a[j+1];

a[j+1]=t;

}

cout<<"\n\nStep:"<<x++<<": \t";

for(int m=0;m<MAX;m++)

cout<<a[m]<<"\t";

}

}

cout<<"\n\nThe contents of the array after sorting are\n\n:";

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

cout<<a[i]<<"\t";

getch();

}



PROGRAM 4 Write a C++ program to store an ARRAY of 10 numbers and implement INSERTION SORT .


#include<conio.h>

const int MAX=10;

void main()

{ clrscr();

int a[MAX],i,j,x=1,t,M;


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

cin>>a[i];

cout<<"\n\nThe contents of the array are;\n\n";

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


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

{ t=i‐1; M=a[i];

while((a[t]>M)&&(t>=0))

{ a[t+1]=a[t];



t‐‐;

cout<<"\n\nStep:"<<x++<<": \t";


cout<<a[m]<<"\t";

}

a[++t]=M;

}

cout<<"\n\nThe contents of the array after sorting are:\n\n";

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

cout<<a[i]<<"\t";

getch();

}



PROGRAM 5

Write a C++ program to store an ARRAY of 10 numbers and implement SELECTION SORT .


#include<conio.h>

const int MAX=5;

void main()

{ clrscr();

int a[MAX],i,j,pos,t;


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

cin>>a[i];


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

cout<<a[i]<<"\t";

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

{ pos=i;

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

if(a[j]<a[pos])



pos=j;

t=a[pos];

a[pos]=a[i];

a[i]=t;

cout<<"\n\nStep:"<<i<<": \t";


cout<<a[m]<<"\t";

}

cout<<"\n\nThe contents of the array after sorting are\n\n:";

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

cout<<a[i]<<"\t";

getch();

}



PROGRAM 6

Write a C++ Program to Input Two Arrays of Size Defined by Userand Display an array merged from these Two Arrays in AscendingOrder.


#include<conio.h>

void input(int a[],int size)

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

{ cout<<"Enter "<<i+1<<" element:";

cin>>a[i];

}

}

void sort(int a[],int size)


{ int t=i‐1,M=a[i];

while((a[t]>M)&&(t>=0))

{ a[t+1]=a[t];

t‐‐;

}



a[++t]=M;

}

}

void display(int a[],int size)


cout<<"\t"<<a[i];

}

void main()

{ clrscr();

int a=0,b=0,c=0,len_a,len_b;

cout<<"Enter the size of Array 1:";

cin>>len_a;

int *A=new int[len_a];

cout<<"\nEnter the elements of Array 1:\n\n";

input(A,len_a);

cout<<"\n\nEnter the size of Array 2:";

cin>>len_b;

int *B=new int[len_b];

cout<<"\nEnter the elements of Array 2:\n\n";



input(B,len_b);

cout<<"\n\nArray 1:" ; display(A,len_a);

cout<<"\n\nArray 2:" ; display(B,len_b);

sort(A,len_a);sort(B,len_b);

int *C=new int[len_a+len_b];

while((a<len_a)&&(b<len_b))

{ if(A[a]>B[b])

C[c++]=B[b++];

else

C[c++]=A[a++];

}

while(a<len_a)

C[c++]=A[a++];

while(b<len_b)

C[c++]=B[b++];

cout<<"\n\nMerged Array:"; display(C,len_a+len_b);

getch();

}



PROGRAM 7

Write a menu driven Program to provide the following operations on Queue using Linked List.

1. ADD an element to QUEUE 2. DELETE an element from QUEUE 3. DISPLAY QUEUE


#include<conio.h>

#include<stdlib.h>

struct queue

{ int data;

queue* ptr;

}*FRONT=NULL,*REAR=NULL ;

void add_queue(int data)

{ queue *temp=new queue;

temp‐>data=data;

if(FRONT==NULL)

{ temp‐>ptr=NULL;



FRONT=REAR=temp;

}

else

{ temp‐>ptr=NULL;

REAR‐>ptr=temp;

REAR=temp;

}

}

void del_queue()

{ queue*temp=FRONT;

if(FRONT!=NULL)

{ FRONT=FRONT‐>ptr;

delete(temp);

}

else

cout<<"Queue is Empty";

}

void display_queue()

{ queue*temp=FRONT;



while(temp!=NULL)

{ cout<<temp‐>data<<"\t";

temp=temp‐>ptr;

}

}

void main()

{ clrscr();

int chk=1,x;

while(chk)

{ for(int i=0;i<6;i++)

{ cout<<"\n"; }

cout<<"\t\t\tQUEUE";

cout<<"\n\n\n\n\t\t1.\tADD an element to QUEUE";

cout<<"\n\n\t\t2.\tDELETE an element from QUEUE";

cout<<"\n\n\t\t3.\tDISPLAY QUEUE";

cout<<"\n\n\t\t4.\tEXIT";

cout<<"\n\n\n\n\t\tEnter your choice:\t";

cin>>x;

switch (x)

{ case 1: clrscr();



cout<<"\n\n\n\n\t\tEnter content of the QUEUE:";

cin>>x;

add_queue(x);

cout<<"\n\n\n\n\t\tThe new QUEUE is:\n\n\t\t";

display_queue();

break;

case 2: clrscr();

cout<<"\n\n\n\n\t\tThe old QUEUE is:\n\n\t\t";

display_queue();

del_queue();

cout<<"\n\n\n\n\t\tThe new QUEUE is:\n\n\t\t";

display_queue();

break;

case 3: clrscr();

cout<<"\n\n\n\n\t\tThe QUEUE is:\n\n\t\t";

display_queue();

break;

case 4: exit(0);

break;

default: cout<<"\n\n\t\tINVALID INPUT.";

}



getch();

clrscr();

}

getch();

}



PROGRAM 8

Write a menu driven Program to provide the following operations on STACK using Linked List.

1. ADD an element to STACK 2. DELETE an element from STACK 3. DISPLAY STACK


#include<conio.h>

#include<stdlib.h>

struct stack

{ int data;

stack*ptr;

};

stack*START=NULL;

void push(int a)

{ stack*temp=new stack;

temp‐>data=a;

if(START==NULL)



{ temp‐>ptr=NULL;

START=temp;

}

else

{ temp‐>ptr=START;

START=temp;

}

}

void display()

{ stack*temp=START;

if(START==NULL)

cout<<"The STACK is empty";

while(temp!=NULL)

{ cout<<temp‐>data<<"\t";

temp=temp‐>ptr;

}

}

void pop()

{ stack*temp=START;

if(START!=NULL)

{ START=temp‐>ptr;



delete temp;

}

}

void main()

{ clrscr();

int chk=1,x;

while(chk)

{ for(int i=0;i<6;i++)

{ cout<<"\n"; }

cout<<"\t\t\tSTACK";

cout<<"\n\n\n\n\t\t1.\tPUSH an element to STACK";

cout<<"\n\n\t\t2.\tPOP an element from STACK";

cout<<"\n\n\t\t3.\tDISPLAY STACK";

cout<<"\n\n\t\t4.\tEXIT";

cout<<"\n\n\n\n\t\tEnter your choice:\t";

cin>>x;

switch (x)

{ case 1: clrscr();

cout<<"\n\n\n\n\t\tEnter content of the STACK:";

cin>>x;

push(x);



cout<<"\n\n\n\n\t\tThe new STACK is:\n\n\t\t";

display();

break;

case 2: clrscr();

cout<<"\n\n\n\n\t\tThe old STACK is:\n\n\t\t";

display();

pop();

cout<<"\n\n\n\n\t\tThe new STACK is:\n\n\t\t";

display();

break;

case 3: clrscr();

cout<<"\n\n\n\n\t\tThe STACK is:\n\n\t\t";

display();

break;

case 4: exit(0);

break;

default:cout<<"\n\n\t\tINVALID INPUT.";

}

getch();

clrscr();

}



getch(); }

Arrays and Data Structures in C++

Documents

Transcript of Arrays and Data Structures in C++