Individual Review Ticket (Mini-Project) - Ethan Tran

[realethantran]

Ethan

Video Link

Frontend contributions:

Key commits/additions:

• Animations for the cars, representing speed based off backend fetch for sorting algorithm times
• Fetch sorting speeds from the backend so that they can be used to determine racecar speeds in the frontend
• Button to reset cars to their original positions

Backend contributions:

Key commits/additions:

• Refined previous code, reducing redundancy from previous issue
• Use of Inheritance (extends) from a superclass for the sorting algorithms

• Sorting methods, extend from SortingAlgorithm superclass

    // merge sort
    class MergeSort extends SortingAlgorithm {
        @Override
        void sort(int[] arr) {
            Arrays.sort(arr);
        }
    }

    // insertion sort
    class InsertionSort extends SortingAlgorithm {
        @Override
        void sort(int[] arr) {
            int n = arr.length;
            for (int i = 1; i < n; ++i) {
                int key = arr[i];
                int j = i - 1;

                while (j >= 0 && arr[j] > key) {
                    arr[j + 1] = arr[j];
                    j = j - 1;
                }
                arr[j + 1] = key;
            }
        }
    }

    // bubble sort
    class BubbleSort extends SortingAlgorithm {
        @Override
        void sort(int[] arr) {
            int n = arr.length;
            for (int i = 0; i < n - 1; i++) {
                for (int j = 0; j < n - i - 1; j++) {
                    if (arr[j] > arr[j + 1]) {
                        int temp = arr[j];
                        arr[j] = arr[j + 1];
                        arr[j + 1] = temp;
                    }
                }
            }
        }
    }

    // selection sort
    class SelectionSort extends SortingAlgorithm {
        @Override
        void sort(int[] arr) {
            int n = arr.length;
            for (int i = 0; i < n - 1; i++) {
                int minIdx = i;
                for (int j = i + 1; j < n; j++) {
                    if (arr[j] < arr[minIdx]) {
                        minIdx = j;
                    }
                }
                int temp = arr[minIdx];
                arr[minIdx] = arr[i];
                arr[i] = temp;
            }
        }
    }

• Random list generated for the algorithms to sort
• The arraySize (amount of numbers in the array) can be set by the user in the frontend
• The algorithmSpeed for each sort is inserted into a Hashmap

[KKcbal]

Individual Review AJ Ruiz grading Ethan Tran

• [x] Individual should show that they were key contributor and example to team. This includes their participation in ideas, plans, creating individual issues, providing code commits to project, crossover grading participation, being on task and positive example in the classroom.

Individuals Video, Issue(s), Commits(s)

• [x] Video, includes Web demo of key contribution to project, 1 minute - 0.8
• [x] Issue(s) that show plans/progress to team objectives - 0.75
• [x] Highlights of key commit(s) in Issues, summarizes code contributions - 0.8
• [x] Review GitHub analytics for key commits in each weeks during the project, shows consistent participation for 3 weeks - 0.9 3.25/3.6

video was well made and gave a good demonstration. There was that bet button that left me curious, and could have helped give extra points if at least loosely explained.

There was plans and they were moved along the scrum board but there wasn't any detail under each step.

Shows key commits on frontend and backend. Explains what each commit is about.

Commited everyday