README.txt Class Number: CPSC335_02 Project Number: 2 Team Name: MEN Members: Kevin Lopez & Emiliano Arranaga Intro This project displays four different sorting algorithms: Merge sort, Insertion sort, Quick sort, and Gold’s Poresort. The algorithms will take a 15-character hexadecimal string and sort it from least to greatest. After each algorithm has sorted the string, it will take the starting string, take the last character and move it to the front. The program clears the webpage and starts over with the new string. The algorithms and webpage were all implemented in javascript. Zip contents File readme.txt (this file that you are reading) Folder code (this will contain the index.html webpage) File index.html (this will run the actual project) Folder files (contains styles.css file) File styles.css (file with webpage characteristics) Document Running_Time_Paper.docx (contains contents about the running time of each algorithm) Installation & Running 1. Download the zip folder onto your computer. 2. Open the code folder. Either drag and drop the index.html file into your web browser or double click on the index.html file and it will open on the computers preset web browser. External Requirements There should be no external requirements that we are aware of at this time. The project should work with any web browser. Issues Some issues we came across when builiding 1. After finding more resources and information, Gold's Poresort may not be completely finished. 2. When going over the project, we realized we missed a step and had to revert back to a prior save file. 3. Issues came across trying to get the ring implemented, the array would not cycle the last element. 4. Could not figure out what to display for the Quick sort algorithm. 5. Output was too large for insertion, ran out of time to fix.