title: Matchmaking algorithm for a game
body: <p>(This is for a game I am designing) Lets say that there are 2 teams of players in a game. Each team will have 4 players. Each player has a rank(0-9), where 0 indicates a bad player and 9 indicates an amazing player. There is a queue (or list) of players who are waiting to play a game (This could be a small number or a very large number). Lets say that each teams' overall rank is an average of the 4 players within in. There are multiple open games and teams where a player can be placed.</p>
  
  <p>Question: What is a good algorithm that places a player in the waiting queue/list on a team so that each team in a game will have more or less the same overall rank in a game (Does not have to be perfect)? Also, the players should not have to wait more than a minute to be placed on a team(Can be more if very little players) [The faster they are placed, the better]</p>