Sorts Crossover Grading Final Score: 4.37/5 - Graded by AK

[TMarwah]

Build custom Bubble Sort, Selection Sort, Insertion Sort and Merge Sort. 25% Build a GitHub page that describes Sort implementations and the Big O complexity of these Sorts. 25%

Analysis 25%

• Establish analytics including: time, comparisons and swaps.
• Average the results for each each Sort, run each at least 12 times and 5000 elements. You should throw out High and Low when doing analysis.
• Make your final/judgement on best sort considering Data Structure loading, Comparisons, Swaps, Big O complexity, and Time.

Individual GitHub pages, Replit, IntelliJ 25%

• Organize files, directories and menus for all weeks.
• Make your GitHub pages fold into a personal portfolio
• Make sure all Code and Analytics runs on Replit and IntelliJ
• Ensure Individual GitHub Repository shows iteration on work (minimum of 10 commits on Java and 10 commits on Pages)

[akprathipati]

Total score: 4.37/5 (87.5%) Graded By Ak Prathipati

Build custom Bubble Sort, Selection Sort, Insertion Sort and Merge Sort. 25% Well done, the code looks great.
Build a GitHub page that describes Sort implementations and the Big O complexity of these Sorts. 25% The sorts are well done, seen the code. The description is good. The analytics need more work overall but great attempt 12.5%

Individual GitHub pages, Replit, IntelliJ 25% All the commits look good, well done overall.