Implement matching algorithm

[whymarrh]

As of writing, the users can login/register, and enter their schedules.

The matching algorithm needs to be implemented - this will be easier once #12 is completed.

[whymarrh]

cc @MitMaro

I started some work in my matching-algo branch (see lines 49-52 in AbaLookup\Match). Do you want to assign this issue to yourself? Despite the information in the Wiki, I'm having trouble understanding the algorithm. This no longer exists.

[whymarrh]

I think this should be in its own module (in the same project, but its own module in the project). That way it'd be a bit more reusable. We could have it so, given the user's schedule, it returns the list of matches. We could even have it so we pass in flags for the sort order. Thoughts?

[MitMaro]

I agree on it's own module. We need a get together to discuss the algorithm. We will have a face-to-face meeting soon.

[MitMaro]

Score = SUM(S_n), where S_n = {0, t < a; t², a ≤ t ≤ b, a > b; b² + (t - b), t > b}

Where S_n is the score for partition n, t is the number of time slots in S_n, a is the desired minimum duration, b is the desired maximum duration.

[whymarrh]

How are we planning on representing the scores? Integers vs. floats?

[MitMaro]

Integers. There are no floats in the score.