Montana State University Linked List Political RiffRaff Manager Discussion
Subject
Programming
School
Montana State University - Bozeman
Question Description
General Overview
In case you missed it there is an election in a couple of weeks, and in politics America is very divided. I have decided you will write a program to select our politicians that take office in a fair and just way. Now politicians, and all the political supporters on both sides of the aisle have come out of the woodwork spouting their verbal abuse on each other. All of your favorite TV shows have been taken over by political advertisements. I don't like all this political nonsense so you are going to write a program to eliminate elections. That way we don't have to worry about those pesky Russians playing with our toys.
You are going to fix it the problem.
Every year ACM sponsors programming competitions at the local, regional and world levels. This assignment is adapted from a problem that appeared at one of these competitions...........very loosely adapted.
Purpose
The purpose of the assignment is to give you experience implementing a circular, doubly linked list and all the methods and management that is needed for such a list.
Problem Statement
In a serious attempt to downsize (reduce) the riffRaff in politics, The New Sloth Party with the motto "we promise to keep none of our promises", (which is an infinite loop error), has decided on the following strategy. Every day all Sloth applicants will be placed in a large circle, facing inwards. Someone is arbitrarily chosen as number 1, and the rest are numbered up to N (so N is the number of candidates in the circle and N will be standing next to 1 as the end of the potential candidates, think of a clock with 12 and 1 next to each other).