Is there a sort the performs dynamic programming? By definition, dynamic programming relies on the optimal solution of subproblems to generate the optimal solution. Insertion sort relies on the first i elements being sorted.
Or is it selection sort that is dynamic programming? All I know is that bubble sort is brute force.
No comments:
Post a Comment