Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
SSQ
GitHub Repository: SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming
Path: blob/master/Programming Assignment 4/README.md
423 views

File Description

  • .txt files are data file.

    • knapsack1.txt with 10000 knapsack size and 100 items;

    • knapsack_big.txtwith 2000000 knapsack size and 2000 items.

  • .ipynb file is the solution of Week 4 programming assignment

    • knapsack1.ipynb

    • knapsack_big.ipynb

  • .html file is the html version of .ipynb file.

    • knapsack1.html

    • knapsack_big.html

Snapshot

open .html file via brower for quick look.

Implementation

  • Knapsack Algorithm