Click here to Skip to main content
15,895,084 members
Please Sign up or sign in to vote.
1.00/5 (1 vote)
See more:
- Write recursive and non-recursive functions that check parenthesis in a string.

Example:
Input string: (a(b(c)d)e)
Output: true
Posted
Comments
Sandeep Mewara 6-Jan-13 11:30am    
What have you tried so faR?
ridoy 6-Jan-13 15:30pm    
try to do it yourself,if face any problem then come here to share with us..

1 solution

Since this smells lots of homework, I'll give you no code.

But, it's not complex.
Non recursive:

0) Create a integer counter , set to zero.
1) Loop through each character in the string (a foreach loop is perfect for this)
1.0) If the character is a '(', increment the count by one
1.1) If the character is a ')', decrement the count by one
2) After the loop, check the count - if it is zero, all brackets match.

Recursive:
I wouldn't use recursion for this. It's a sledgehammer to crack a simple nut...
 
Share this answer
 
Comments
Thomas Daniels 6-Jan-13 10:11am    
Good answer, +5!

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900