Skip to content

Latest commit

 

History

4 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Study-plan-with-greedy-algorithm

Build a MAXHEAP according to positions' salaries, by comparing differences between parent nodes and child nodes, calculate the approximate value of each skill, combining them with estimated study time, and use greedy algorithm to make a study plan.

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages