| [ QuizWit ] in KIDS 글 쓴 이(By): iLUSiON (화려한집념) 날 짜 (Date): 2003년 7월 5일 토요일 오전 09시 03분 48초 제 목(Title): Re: what f* is? oh... thank you guest. ^^ i think that example illustrate the difference between recursion and iteration i learned in CS101. hehe... but it doesn't seem to illustrate the power of dynamic programming. ^^ can you explain it with sales man problem(?) not sure if the name of the problem is correct. we have n cities c1, ... cn. we know the distance between any ADJACENT two cities. call it d(ci,cj). based on this info, how do we find a path with minimal travel distance between arbitary NONADJACENT cities ci and cj? help me to understand it. :) iLUSiON whitepolarcow@hotmail.com |