Array List Stack Queue
-
Upload
amishadalal -
Category
Documents
-
view
229 -
download
0
Transcript of Array List Stack Queue
-
8/10/2019 Array List Stack Queue
1/19
Selection Sort
#include
void selectionSort(int AR[],int size)
{
int i,j,temp;
for (i=0; i
-
8/10/2019 Array List Stack Queue
2/19
Bubble sort
#include
#include
void main()
{clrscr();
int a[50],n,i,j,temp;
coutn;
cout
-
8/10/2019 Array List Stack Queue
3/19
Insertion Sort
#include#include
void main(){clrscr();int a[100],i,n,p,ptr,temp;
cout
-
8/10/2019 Array List Stack Queue
4/19
Linear Search
#include#include
void main(){clrscr();
int a[100],i,n,item,s=0;
cout
-
8/10/2019 Array List Stack Queue
5/19
Binary Search
#include#includevoid main(){clrscr();int a[100],n,i,beg,end,mid,item;
cout
-
8/10/2019 Array List Stack Queue
6/19
}getch();}
Implementation of Linked List
#include#includestruct Node
{int info; //info variable will store data of a Node.Node *link; //link pointer will store the address ofNext Node.};
Node *start=NULL; //*start=NULL means Intially Linked Listis Empty.
void Insert();void Delete();
void Search();void Display();
void main(){clrscr();int choice;
for(;;) //Infinite Loop.{cout
-
8/10/2019 Array List Stack Queue
7/19
case 2:Delete();Display();break;
case 3:Search();
break;
case 4:Display();break;
case 5:return; //Exit
default:coutlink=start;start=temp;}
void Delete() //Delete Starting Node fromList.{if(start==NULL)coutlink=NULL;cout
-
8/10/2019 Array List Stack Queue
8/19
coutitem;while(temp!=NULL){if(item==temp->info){cout
-
8/10/2019 Array List Stack Queue
9/19
Implementation of Stack using Array
#include#include#define max 10 //Maximum Size of Stack
int stack[max];int top=-1,item; //top=-1 means Stack is Empty.
//First Element will be stored at ZeroLocation. (top=0)void main(){
clrscr();int choice;
void Push();void Pop();void Display();
for(;;) //Infinite Loop.{coutchoice;
switch(choice){case 1:Push();break;
case 2:Pop();
break;
case 3:Display();
-
8/10/2019 Array List Stack Queue
10/19
break;
case 4:return; //Exit
default:cout
-
8/10/2019 Array List Stack Queue
11/19
else{item=stack[top];top=top-1;cout
-
8/10/2019 Array List Stack Queue
12/19
case 2:Delete();break;
case 3:Display();
break;
case 4:return; //Exit
default:cout
-
8/10/2019 Array List Stack Queue
13/19
void Delete() //Delete Element from Queue.{
if(front==-1)cout
-
8/10/2019 Array List Stack Queue
14/19
switch(choice){case 1:Ins_end();break;
case 2:
Ins_pos();break;
case 3:Del_val();break;
case 4:Del_pos();break;
case 5:return; //Exit
default:cout
-
8/10/2019 Array List Stack Queue
15/19
coutpos;
if(posn+1){cout
-
8/10/2019 Array List Stack Queue
16/19
{coutpos;
if(posn){cout
-
8/10/2019 Array List Stack Queue
17/19
cout
-
8/10/2019 Array List Stack Queue
18/19
{if((front==0 && rear==size-1) || (front==rear+1))cout
-
8/10/2019 Array List Stack Queue
19/19