Implementing the greedy algorithm for the matching of the student in the 1000+ project.
The difference is that there will be no students' ranking as the student do not know the companies and teams prior to the matching. Main constraints would be nationalities and fields of studies.
Implementing the greedy algorithm for the matching of the student in the 1000+ project.
The difference is that there will be no students' ranking as the student do not know the companies and teams prior to the matching. Main constraints would be nationalities and fields of studies.