CSE315-Algorithm

Fall 2021

National Sun Yat-sen University

Instructor

Chun-Wei-Tsai

Contents

• The repo is homeworks for solving 0/1 knapsack problem with 4 different methods, and each has its pros and cons.
  1. Exhaustive Search
  2. Greedy
  3. Dynamic Programming
  4. Simulated Annealing
• To clone the repo, type the command below.

git clone https://github.com/aryenchiu/CSE315-Algorithm.git

• To execute the program, change the directory to the corresponding methods first, then compile and execute.

g++ <filename.cpp> -o <filename>
./<filename>