wise-saint/job_scheduling

Job scheduling : Greedy Algorithm versus Brute Force Algorithm. Comparison of time of complexities.

Job_Scheduling

Job scheduling : Greedy Algorithm versus Brute Force Algorithm

Greedy Algorithm

Choosing the locally optimal choice available at each stage. And finally, combining the all locally optimal choices selected at each stage to give the globally optimal solution. The algorithm is “greedy” in the sense that each local optimum is found solely by considering what is best at that step, with no consideration of future steps.

Analysis of Greedy Algorithm in Job Scheduling : T(n) = O(n²)

Brute Force Algorithm

Enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem’s statement or not. This is basically a problem of permutation and combinatorics.

Analysis of Brute Force Algorithm in Job Scheduling : T(n) = O(n*2ⁿ)