{"action":"closed","issue":{"url":"https://api.github.com/repos/DrRowland/SPA/issues/1","labels_url":"https://api.github.com/repos/DrRowland/SPA/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/DrRowland/SPA/issues/1/comments","events_url":"https://api.github.com/repos/DrRowland/SPA/issues/1/events","html_url":"https://github.com/DrRowland/SPA/issues/1","id":104964533,"number":1,"title":"favours students high in list","user":{"login":"bkirman","id":1206979,"avatar_url":"https://avatars.githubusercontent.com/u/1206979?v=3","gravatar_id":"","url":"https://api.github.com/users/bkirman","html_url":"https://github.com/bkirman","followers_url":"https://api.github.com/users/bkirman/followers","following_url":"https://api.github.com/users/bkirman/following{/other_user}","gists_url":"https://api.github.com/users/bkirman/gists{/gist_id}","starred_url":"https://api.github.com/users/bkirman/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/bkirman/subscriptions","organizations_url":"https://api.github.com/users/bkirman/orgs","repos_url":"https://api.github.com/users/bkirman/repos","events_url":"https://api.github.com/users/bkirman/events{/privacy}","received_events_url":"https://api.github.com/users/bkirman/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":4,"created_at":"2015-09-04T20:28:42Z","updated_at":"2015-09-08T09:47:21Z","closed_at":"2015-09-08T09:47:21Z","body":"If I read it right, getSomeUnassignedStudentWithNonEmptyList reads students from the list in order. In this way students at the top of the list get their first favoured project. Therefore later students may be unfairly left in the unallocated pool. A simple but inelegant solution is to shuffle the list of students after it is read from the file"}}