Cost Estimation of Dynamic Programming Algorithm for Solution of Graphical as well as Network Problems for minimum path Dixit Anand Kumar, Jain Manish, Srivastava Adarsh, Misra Ashish Asst. Professor (MCA), Jagran Institute of Management, 620, W Block Saket Nagar, Kanpur, U.P.-208014 Online published on 26 June, 2013. Abstract The cost estimation for any algorithm defines the running time for that algorithm means to say how much time it taken to produce the solution. It defines the performance of algorithm. The dynamic programming approach is a problem solving technique that solves problems by dividing them into sub problems. Dynamic programming is used when the sub problems are not independent e.g. when the share the same sub problems. Multistage decision policy with recursive approach will provides a well-organized way while using Dynamic programming. In multistage decision process the problem is divided into several parts called as sub problems and then each sub problem will be solved individually and the final result will be obtained by combining the results of all the sub problems. With the help of asymptotic notations, calculate the running time complexity of dynamic programming method for solution of graphical as well as network problems for the minimum path between nodes. Top Keywords Algorithm, Asymptotic Notation, Cost Estimation, Complexities for algorithms, Dynamic programming, Optimal Structure, Overlapping Problems, Multistage decision policy. Top |