3 ms·
It's effectively a greedy algorithm where the first occurrence takes the most time, and there are no passengers left for the second bus, so it's load time is lo
by Topgamer7 8y ago
It's effectively a greedy algorithm where the first occurrence takes the most time, and there are no passengers left for the second bus, so it's load time is lower, and it will catch up.
It's a pretty visualization though :)