int stack[] = new int[10000]; int stackHeight=1; int Ccount=0, Lcount=0, Ecount=0, Rcount=0, Scount=0; boolean EBisDone; int firstCorner=0; int pop() {if (stackHeight==0){ println("Stack is empty"); stackHeight=1;}; return(stack[--stackHeight]);} void push(int c) {stack[stackHeight++]=c; } void resetStack() {stackHeight=1;}; void EBinit() { for (int v=0; v0.00001) { r=log(x) / log(2);} ; return(r);}