|
Sorting Algorithms as a Tool for Picklisting
Today in my computer science course we learned about sorting algorithms (insertion sort, merge sort, etc). These are methods of sorting a list of values using some comparison operation (using < or >).
The whole idea of making a pick list is essentially to sort a list of teams in order of desirability. It occurred to me that these algorithms could possibly be applied to making this list. Does anyone have any experience applying a computational sorting algorithm for this, or any other thoughts on how well it would work?
__________________
2016-present, Mentor, FRC 2791 - Shaker Robotics
2016: Tech Valley SF (5236, 2791, 3624) and Quality, Finger Lakes SF (5254, 2791, 2383), Battlecry@WPI Winner (195, 2791, 501), Robot Rumble Winner (2791, 195, 6463)
2016-present, Mentor, FRC 1257 - Parallel Universe
2016: Mount Olive Winner (1257, 5624, 1676), Bridgewater-Raritan Finalist (1257, 25, 3340, 555) and GP, MAR CMP Winner (225, 341, 1257), Archimedes SF (4003, 4564, 5842, 1257), IRI Invite
2012-2015, Student, FRC 1257 - Parallel Universe
2015: Mount Olive QF (1257, 1811, 1923) and Safety Award, North Brunswick Finalist (11, 193, 1257) and Team Spirit and Safety Awards
2014: Clifton Winner (1626, 869, 1257), MAR CMP QF (1257, 293, 303)
2013: TCNJ Safety Award
2012: Mount Olive QF (204, 303, 1257)
|
As we all know, a low Center of Gravity is a beautiful thing. - Andy Baker [more] 
Threaded Mode