Click here to Skip to main content
15,905,682 members

Comments by Zubair Farahi (Top 3 by date)

Zubair Farahi 12-Sep-17 17:17pm View    
for checking if the top of the stack is not in pair with array of s[i]
Zubair Farahi 12-Sep-17 17:03pm View    
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef char T;
#include "stack.h"

int isBalanced(char s[100])
{
Stack *stack;
int n=strlen(s);
int i;
for(i=0;i<n;i++)
{
if(s[i]=='(' || s[i]=='[' || s[i]=='{')
{
Push(&stack,s[i]);
}
else if(s[i]==')' || s[i]==']' || s[i]=='}')
{
if(IsEmptyStack(stack))
{
return 0;
}
else if(Top(stack)!=s[i])
Pop(stack);
}
}
if(IsEmptyStack(stack))
return 1;
else
return 0;


}

int main()
{
char s1[100]="((()))", s2[100]="((())(";

if(isBalanced(s1))
printf("Balanced | \n");
else
printf("Not balanced | \n");

if(isBalanced(s2))
printf("Balanced | \n");
else
printf("Not balanced | \n");

return 0;
}
Zubair Farahi 12-Sep-17 16:54pm View    
ops! dam sorry a "Segmentation fault: 11"