7/24/2019 merge sort, stack, binary search

1/3

#include#includeint stack[10];int top=-1,n=10;void push(int data ){if(!isfull())

{top=top+1;stack[top]=data;}else printf("could not insert data, stack is full\n");}void pop(){if(!isempty()){top=top-1;}

else printf("could not retrive data, stack is empty\n");}

int isfull(){if(top==n) return 1;else return 0;}int isempty(){if(top==-1) return 1;

elsereturn 0;}int peek(){ return (stack[top]);}void print(){int i;printf("stack:");for(i=0;i

7/24/2019 merge sort, stack, binary search

2/3

void msortdiv(int,int);int a[50],n;void main(){int i;clrscr();printf("Enter the number of elements:\n");scanf("%d",&n);

printf("Enter the elements:\n");for(i=0;i

7/24/2019 merge sort, stack, binary search

3/3

printf("enter the terms\n");for(i=0;i