SamiDeshatty
commented
2 years ago CROSSOVER GRADE: 4.7/5
Sorts and Analysis -- Coding, Comments, and Documentation
-
Build custom Bubble Sort, Selection Sort, Insertion Sort and Merge Sort. 25% 0.9/1 Sorts are working fine but code does not stop!
-
Build a GitHub page that describes Sort implementations and the Big O complexity of these Sorts. 25% 1/1 Github page (Data structure branch) explains all the Sort implementations; Big O complexity of every sort is presented. Code Snippets are included
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. 0.8/1 Time is not present explicitly; Sort runs more than 12 times and has more than 5000 elements;
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)
2/2 All weeks are presented separately in Github and Replit; Personal Portfolio present in Github; All code in committed on github into replit; 100 commits on Java and Pages combined
Total Score: 4.7/5 (Crossover Grader: Sameeksha Deshatty)
Sorts and Analysis
Individual GitHub Pages