Click here to Skip to main content
13,006,530 members (76,129 online)
Rate this:
Please Sign up or sign in to vote.
See more:
- Write recursive and non-recursive functions that check parenthesis in a string.

Input string: (a(b(c)d)e)
Output: true
Posted 6-Jan-13 3:59am
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

Rate this: bad
Please Sign up or sign in to vote.

Solution 1

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.

I wouldn't use recursion for this. It's a sledgehammer to crack a simple nut...
ProgramFOX 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)

  Print Answers RSS
Top Experts
Last 24hrsThis month

Advertise | Privacy | Mobile
Web02 | 2.8.170628.1 | Last Updated 6 Jan 2013
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100