Using the code example below:
function parenCheck(cString) {
var cStringArray = cString.split(\"\");
}
Describe (you can use pseudo-code or write the function in JSFIDDLE) of an algorithm that can check an algebraic expression to determine if the parentheses are balanced. For example; passing the text string \"3 * (x + (y + 9) - 4)\" should answer true the string \"3 * (x + (y + 9 - 4)\" should answer false Use the CORRECT data structure to create an efficient algorithm.
Solution
function parenCheck(cString) {
var cStringArray = cString.split(\"\");
var p = 0;
for(var v : cStringArray){
if(v==\'(\')
p++;
else if(v==\')\')
p--;
}
if(p==0)
return true;
else
return false;
}
.
Using the code example below- function parenCheck(cString) { var cStri.docx
1. Using the code example below:
function parenCheck(cString) {
var cStringArray = cString.split("");
}
Describe (you can use pseudo-code or write the function in JSFIDDLE) of an algorithm that can
check an algebraic expression to determine if the parentheses are balanced. For example; passing
the text string "3 * (x + (y + 9) - 4)" should answer true the string "3 * (x + (y + 9 - 4)" should
answer false Use the CORRECT data structure to create an efficient algorithm.
Solution
function parenCheck(cString) {
var cStringArray = cString.split("");
var p = 0;
for(var v : cStringArray){
if(v=='(')
p++;
else if(v==')')
p--;
}
if(p==0)
return true;
else
return false;
}
