Skip to content

Latest commit

 

History

History
13 lines (11 loc) · 335 Bytes

File metadata and controls

13 lines (11 loc) · 335 Bytes

Introduction

This is the note about the algorithm course.

Including

The problem set is a guide to dive into more sophisticated algorithm study

  1. Recursion
  2. Divide and Conquer
  3. Dynamic Program
  4. Greedy
  5. Backtrack

Dependence

all the problem description can be found in the http://acm.scu.edu.cn/teach/main.html