/StudyPlanWithGreedyAlgorithm

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.

Primary LanguagePythonMIT LicenseMIT

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.