title: Stable Marriage algorithm for student×group association
body: <p>I am developing an application program which holds students names in a list and their group number.<br>
  Each student can transfer to another group so there is another field which carries their wishes. </p>
  
  <p>I want the program to carry matching group number with students wishes and getting the best result with 0 conflict and updating an SQLite database.</p>
  
  <p>Someone has told me to use the stable marriage algorithm: it would be perfect for this type of problem.  </p>
  
  <p>The problem is that I don't know much about this last one and how it would be looks like in android so if you can offer me a simple explanation and an example which has SQLite, Java code it would be perfect.</p>