Skip to content

AlexandrosMingas-dev/Project-C

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

The algorithm treats the event as a series of discrete time slots (e.g., 18:00, 19:00, 20:00). It calculates the how many bands are present at each specific hour and then identifies the busiest (or quietest) continuous interval.

About

Event Schedule Optimizer. C application that calculates optimal event attendance times by analyzing overlapping schedules

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages