Skip to content
Snippets Groups Projects
Commit 83b39f52 authored by Brandon Rodriguez's avatar Brandon Rodriguez
Browse files

Add instructor notes to project's main

parent 48c5fe11
Branches
No related merge requests found
/**
* Brandon Rodriguez
* CS3310 Assignment 3
* 10-27-17
*/
/**
* Assignment Goal:
* To be comfortable with multiple, basic sorts on both arrays and linked lists.
* To also be able to analyze and compare said sorts against each other, in regards to both space and time.
*
* "I give permission to the instructor to share my solution(s) with the class."
*/
/**
* Notes:
* I added additional data to the linked lists, which helps display the "stability" of each sort.
* Admittedly, keeping track of this may add (a mostly negligible) additional time to list processing,
* while arrays would stay the same. With extremely large list sizes, this difference may be visible.
*
* This additional data is only used/shown if the user types either "yes" or "y" at the appropriate prompt.
*
*
* In regards to sorting by the user's "input name", it doesn't really make sense to sort by a given character twice.
* Thus, if the user's input has duplicate characters, only the first instance of said character is accounted for.
*
* HOWEVER, all additional instances are still stored within the dictionary, just not used. So if, in the future,
* one decided to do something with these duplicate characters after all, they would simply need to access
* the dictionary and implement whatever logic they desire.
*/
/**
* Known Issues:
* In regards to the "stability" data, noted above, the user interface expects the stability values
* to stay at one character in size. IE: If any single letter occurs 10 or more times,
* then the output spacing is thrown off.
*
* Due to both this, and the note above, it is recommended to only show stability of sorts with small number input.
*/
package edu.wmich.cs3310.a2; package edu.wmich.cs3310.a2;
......
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment