Code For Check Balance Parentheses using C-Programming.

#include<stdio.h>
#include<conio.h>
void push(int *top,char s[],char exp,int max);
int pop(int *top,char s[]);
int isEmpty(int *top);

int isEmpty(int *top)
{
   if(*top<=-1)
     {return 1;}
   else
     { return 0;}
}
void push(int *top,char s[],char exp,int max)
{
  if(*top>=max-1)
   {printf("Given expression is Not Balanced Parenthese");
   }  
  else
   {*top=*top+1;
      s[*top]=exp;
    }
}
int pop(int  *top,char s[])
{
  if(*top<=-1)
   { printf("Given expression is Not Balanced Parenthese");
      return 1;}
  else
    {
       int item=s[*top];
      *top=*top-1;
       return item;
    }
}

void main()
{
  int *top,max=10,valid=0,len,i;
  char exp[10],s[10];
  *top=-1;
   clrscr();
   printf("Enter Expression : ");
   gets(exp);
   len=strlen(exp);
   for(i=0;i<len;i++)
   {
      if(exp[i]=='(' || exp[i]=='{' || exp[i]=='[')
       {
          push(top,s,exp[i],max);
        }
       else if(exp[i]==')' || exp[i]=='}' || exp[i]==']')
        {
            pop(top,s);
         }
       else
         {
            printf("Error:");
          }
   }

  if(isEmpty(top))
  {
    printf("Given expression is Balanced Parenthese");
  }
   else
   {
     printf("Given expression is Not Balanced Parenthese");
   }
   getch();
}
      




Comments

Post a Comment

Popular posts from this blog

Code for BUBBLE Sort

Image
1                                                      Bubble sort Ø        #include<stdio.h> #include<conio.h> void BubbleSort(int[] , int); void main() {    int array[10], n, i;    clrscr();    printf("\n\n------------------------ BUBBLE SORT -----------------------");    printf("\n\n ENTER NUMBER OF ELEMENTS : ");    scanf("%d", &n);    printf("\n");    for (i = 0 ; i < n ; i++ )    { printf("ENTER ELEMENT %d: ",i+1);      scanf("%d", &array[i]);    }    BubbleSort(array,n);    getch(); } void BubbleSort(int array[], int n) {    int i,c,j,temp;    for ( i = 0 ; i < ( n-1 ) ; i++ )    {       for ( j = 0 ; j < n-i-1 ; j++ )       {        if ( array[j] > array[j+1])        {                 temp = array[j];                 array[j] = array[j+1];                 array[j+1] = temp;        }       }       pr
Read more

Code for Circular Linked List c-programing

#include<stdio.h> #include<conio.h> #include<stdlib.h> struct node {  int data;  struct node *next; }; struct node *head; void InsertAtBeginning(int x) {  struct node *temp = (struct node *)malloc(sizeof(struct node));  struct node *temp2 = head;  temp->data = x;  temp->next = NULL;  if(temp==NULL)  {   printf("\n MEMORY UNAVAILABLE");  }  if(head==NULL)  {   head = temp;   temp->next = head;  }  if(temp2->next!=head)  {   temp2 = temp2->next;  }  temp->next = head;  head = temp;  temp2->next = head; } void InsertAtEnd(int y) {  struct node *temp = (struct node *)malloc(sizeof(struct node));  struct node *temp2;  temp->data = y;  temp->next = NULL;  if(temp==NULL)  {   printf("\n MEMORY UNAVAILABLE");  }  if(head==NULL)  {   head = temp;   temp->next = head;  }  while(temp2->next!=head)  {   temp2 = temp2->next;  }  temp2->next = temp;  temp->n
Read more

Code for SELECTION Sort in C-Programming

Image
1                               Selection Sort Ø       #include<stdio.h> #include<conio.h> void SelectionSort(int[] , int); void main() {    int array[10], n, i;    clrscr();    printf("\n\n--------------------- SELECTION SORT --------------------");    printf("\n\n ENTER NUMBER OF ELEMENTS : ");    scanf("%d", &n);    printf("\n");    for (i = 0 ; i < n ; i++ )    { printf("ENTER ELEMENT %d : ",i+1);     scanf("%d", &array[i]);      }    SelectionSort(array,n);    getch(); } void SelectionSort(int array[], int n) {    int i,c,       j,temp;    for ( i = 0 ; i < ( n-1 ) ; i++ )    {       for ( j = i + 1 ; j < n ; j++ )       {            if ( array[i] > array[j])              {                 temp = array[i];                 array[i] = array[j];                 array[j] = temp;               }       }
Read more