Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
en:private:algorithmique09 [2009/11/09 18:21]
masoud
en:private:algorithmique09 [2016/06/23 11:26] (current)
Line 27: Line 27:
   * FastLCS algorithm is not complete (endfor and endif and 2 statements are missing) in  trans_en/​chap4.tex (page 225 in the pdf file) and trans_fr/​chap4.tex. Apparently there is a problem with some definitions.   * FastLCS algorithm is not complete (endfor and endif and 2 statements are missing) in  trans_en/​chap4.tex (page 225 in the pdf file) and trans_fr/​chap4.tex. Apparently there is a problem with some definitions.
   * The constraint for W is missing in the definition of "​GREEDY VERSUS DYNAMIC PROGRAMMING:​ THE KNAPSACK PROBLEM"​ in trans_en/​chap5.tex (page 233 in the pdf file) and trans_fr/​chap5.tex.   * The constraint for W is missing in the definition of "​GREEDY VERSUS DYNAMIC PROGRAMMING:​ THE KNAPSACK PROBLEM"​ in trans_en/​chap5.tex (page 233 in the pdf file) and trans_fr/​chap5.tex.
 +  * The proof of correctness of Djkstra'​s algorithm needs to be added from the course notes to the slides