Skip to content

Month: August 2017

Groupsort 4: Discussion and Pictures

Quick Rebrief To briefly summarize the last three posts in this series on “GroupSort”, in Part 1, we proposed the problem, and came up with a brute-force algorithm to come up with the ideal solution (I’ve previously called it “the naive algorithm”, but I feel this is a little misleading – “brute force” is a better description). We found that this algorithm worked well (duh) for small values, but for real-world class-sizes — as small as about 20 people — it would simply never compute in a reasonable time. So in Part 2, I sketched out the “team-captain algorithm” that…

Continue reading Groupsort 4: Discussion and Pictures

Leave a Comment