greedy

Here is the greedy algorithm – always the best place to start. allocate all teams IF not all sections covered output -1 stop mark all teams non-critical flag_improved = true WHILE( flag_improved == true ) flag_improved = false find most expensive section find most expensive non-critical team on most expensive section IF team found that … Read more