Here is a Python solution for the problem:

```python
def infix_to_postfix(infix):
precedence = {'+':1, '-':1, '*':2, '/':2}
stack = []
postfix = ''
for char in infix:
if char not in "+-*/":
postfix += char
else:
while stack and stack[-1] in "+-*/" and precedence[char]

Question

Here is a Python solution for the problem:

```python
def infix_to_postfix(infix):
    precedence = {'+':1, '-':1, '*':2, '/':2}
    stack = []
    postfix = ''
    for char in infix:
        if char not in "+-*/":
            postfix += char
        else:
            while stack and stack[-1] in "+-*/" and precedence[char] <= precedence[stack[-1]]:
                postfix += stack.pop()
            stack.append(char)
    while stack:
        postfix += stack.pop()
    return postfix

print(infix_to_postfix("1+2*3/4-5"))  # Output: 123*4/+5-
print(infix_to_postfix("5+6-4*8/2"))  # Output: 56+48*2/-
```

This function works by iterating over the infix expression. If the character is a number, it is added directly to the postfix expression. If the character is an operator, it is added to the stack. However, before adding the operator, the function checks if there are any operators on the stack with equal or higher precedence. If there are, they are popped from the stack and added to the postfix expression. After all characters have been processed, any remaining operators on the stack are popped and added to the postfix expression.

Knowee AI · Accepted Answer

Here is a Python solution for the problem:

```python
def infix_to_postfix(infix):
    precedence = {'+':1, '-':1, '*':2, '/':2}
    stack = []
    postfix = ''
    for char in infix:
        if char not in "+-*/":
            postfix += char
        else:
            while stack and stack[-1] in "+-*/" and precedence[char] <= precedence[stack[-1]]:
                postfix += stack.pop()
            stack.append(char)
    while stack:
        postfix += stack.pop()
    return postfix

print(infix_to_postfix("1+2*3/4-5"))  # Output: 123*4/+5-
print(infix_to_postfix("5+6-4*8/2"))  # Output: 56+48*2/-
```

This function works by iterating over the infix expression. If the character is a number, it is added directly to the postfix expression. If the character is an operator, it is added to the stack. However, before adding the operator, the function checks if there are any operators on the stack with equal or higher precedence. If there are, they are popped from the stack and added to the postfix expression. After all characters have been processed, any remaining operators on the stack are popped and added to the postfix expression.

Question

Solution

Similar Questions

Upgrade your grade with Knowee