-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Final Review Ticket #4
Comments
Team Review "Shaurya" grading "Aiden"
Team Review ticket containing key Team and individual contributions
0.80, met expectations This group has demonstrated strong growth and alignment with the team plan, effectively addressing identified shortcomings. However, there are notable gaps in showcasing that this team did not work consistently over the three weeks. The overall score of 0.80/1.0 reflects positive contributions with clear opportunities for improvement in specific areas. |
Individual Review "Shivansh Goel" grading "Ishi Singh"
Individuals Video, Issue(s), Commits(s)
Per check. Freeform comment. .75, Attempted has not connected backend to frontend yet, and is not fully completed yet. There is still a lot of potential in the project. Update: .77 Code for Sorting and Fibonacci works in video, but does not work in demo live. |
Individual Review Edwin Abraham grading Toby Leeder
Individuals Video, Issue(s), Commits(s):
Positives:
Possible Improvements:
ConclusionI liked their project very much and it is very cool in how they decided to approach this problem with the way that they did. I believe that if they continued to polish this website, this could be a great resource for future CSSE, CSP, and CSA students to help them learn different sorting methods Total(0.7)+(0.9)+(0.85)+(0.8))/4=0.8/0.9 |
Team
- Backend
- Backend Commits
Individual
- Finished Backend Initial Infrastructure
- Backend Commits
- Profile
- Main sort page
- Backend Commits
- Profile
- Made fibonacci page
Project
The purpose of this website is to provide a comprehensive platform for users to explore, understand, and compare various sorting algorithms (merge, bubble, selection, and insertion). The website offers an interactive visual representation of these algorithms in action, allowing users to input their own lists or generate random ones of any desired length. The sorting process is visually displayed, aiding in comprehension and comparison of these sorting methods.
The website includes an analysis page that provides in-depth insights into the performance of each algorithm. Users can access information such as the number of swaps, time and space complexity, the time taken by each algorithm to execute, and the number of merges for each algorithm. These metrics are shown in a table to allow users to easily compare and understand the differences between the algorithms.
As for the Fibonacci page, users can get the Fibonacci value at the nth position, as well as the list representation of the Fibonacci sequence. There is also a visual representation to aid in understanding this sequence.
The text was updated successfully, but these errors were encountered: