Gale Shapley Java Program
I hate to be the bearer of bad news but for a problem this specific with an algorithm of this complexity, you're unlikely to get a pinpoint answer. What I can suggest to help you find your bug(s): • You have a lot of collections, in particular arrays of differing sizes. It doesn't really surprise me that you're getting some 'out of whack' positions given this • It looks like you've taken an algorithm expressed in a non-OO language (or perhaps pseudocode) - it could be worth setting up a new class to represent a Taxi and a Passenger, holding all the pertinent details inside, rather than trying to index into a particular array position of a particular array • You have a mixture of method parameters and member variables that means your TaxiScheduler can actually only deal with one call to doGaleShapley() at a time. Open Cdr Files In Gimp Switch. Install Clockingit En Windows. Hyperdesk Star Trek Tos Win7 X86 X64 Windows. This will probably bite you later on unless you move all those member variables into the method • Using 'naked' ArrayLists is a double-no-no: List gives you type-safety while not forcing your client to use an ArrayList • Refactor your doGaleShapley() method into smaller, self-contained, well-named methods that do one thing only • Use Unit Tests to simulate each possible situation. Mills Novelty Company Slot Machine Serial Numbers there.
