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.
-
Notifications
You must be signed in to change notification settings - Fork 0
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.
License
datahubber/StudyPlanWithGreedyAlgorithm
About
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.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published