# C/C++

3467 0
Sorting linked list program in C
This article provides you source code with the sample output of entering nodes in a linked list and then sorting a linked list in C.
Type
Article
3411 0
Selection sort program in C (With Algorithm)
This article will provide you brief details of selection sort with selection sort algorithm & program in C
Type
Article
2932 0
Stack Program in C (Concept, Algorithm & C program example)
This article provides you concept, algorithm & code for stack program in C with push, pop & display operation.
Type
Article
2726 0
In this article, I have explained line by line and provided code for the c program to add two numbers.
Type
Article
2553 0
Program to remove duplicates from array in C
In this article, I have provided code with logic and explanation, how we can remove duplicates from an array in C Code.
Type
Article

2473 0
Fibonacci Series program in C ( With and Without recursion)
In this article, I have provided algorithm to understand about fibonacci series and how to create a program for fibonacci in C.
Type
Article
750 0
Introduction to C++ File handling
In this article, we have provided how to do basic file handling operations in C++ using ifstream and ofstream.
Type
Article
660 1
Want to convert infix to postfix in C but getting error empty stack

I write a C code to convert infix expression to postfix expression. The expression may include '^' , "+", "-" , "/", "*" and all three types of brackets i.e." ({[ ". The code should first check whether the brackets are balanced or not and then do the conversion. But the code is showing an empty stack at the output.

Here is my sample code

...
Type
Question
364 1
Can anybody help me to convert a infix expression into a postfix expression which deals with all three brackets i.e. ({[ in c language?

This is the pseudo code. Create a function that takes an infix expression as input and converts it to a postfix expression. It should

take pointers to two strings as input; one containing the infix expression, and second to which this

function will write the postfix expression i.e. the declaration should be

void infixToPostfix(char *infix, char *postfix, int str_size);

The algorithm is as follows:

Iterate over the infix expression’s string. For each character c,

• If c is an operand, concatenate it with the postfix expression.

• If c is an operator, check if top of stack, say m, is an operator. If so, check if the operator

precedence of m is higher or equal to the operator precedence of c; if yes, concatenate m with

postfix expression, and pop it from the stack. Keep doing this until the top of stack is not an

operator with operator precedence higher or equal to the operator precedence of c. Then push

c on the stack.

• After completely processing input expression, TopAndPop remaining operators from stack and

concatenate each with postfix expression, in the order they are popped.

You can perform string concatenation using strcat().

...
Type
Question

Page 3 of 3