<p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; "><span style="color: rgb(255, 0, 0); ">for(token = get_token(&symbol, &n); token != eos; </span>token = get_token(&symbol, &n)) </p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">{</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">if(token == operand) printf(“%c”, symbol);</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">else if(token == rparen) </p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">{</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; "><span style="color: rgb(255, 0, 0); ">while(stack[top] != lparen)</span></p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">print_token(pop());</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">pop();</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">}</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">else {</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; "><span style="color: rgb(255, 0, 0); ">while(isp[stack[top]] >= icp[token])</span></p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">print_token(pop());</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">push(token);</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; ">}</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; ">}</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; "><br></p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; "> for * while 로 n*n 번의 time complex 아닌가요???(시간복잡도)</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; ">다른 자료 여기저기 찾아봤는데 n번이라는 얘기가 있는데 제가 잘못이해하고 있나요??</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; ">(본 코드는 postfix 코드중 일부입니다.)</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; "> </p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; ">빅 오 자체가 최악의 경우를 생각하는건데</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; ">if 문에 있는 돌게 되는 경우로 쳐야되니까 O(n^2) 의 형태가 아닌가요?</p><p style="font-family: Gulim; font-size: 12px; line-height: 21px; text-align: justify; ">근데 계산 이론상 O(n)인건 왜 그런거지...</p></p>
댓글 분란 또는 분쟁 때문에 전체 댓글이 블라인드 처리되었습니다.