aaron-rub / aaron-rub1

1 stars 0 forks source link

Reflection #2

Open aaron-rub opened 9 months ago

aaron-rub commented 9 months ago

Java Learnings

Insertion sort, It's a simple sorting method. It works by splitting the list into sorted and unsorted parts. Then, it takes one element from the unsorted part and puts it in the right place in the sorted part. It keeps doing this until there are no more unsorted elements. Coding this in Java helped me understand the logic of the algorithm and how to code efficiently. It was a good step in my learning path.

public class Main {
    public static void main(String[] args) {
        int[] array = {4, 3, 2, 10, 12, 1, 5, 6};
        insertionSort(array);
        for (int i : array) {
            System.out.print(i + " ");
        }
    }

    static void insertionSort(int[] array) {
        for (int i = 1; i < array.length; ++i) {
            int key = array[i];
            int j = i - 1;

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

Scrum Ideation

More importantly this trimester I learned the hard way about the importance of having a good scrum team. As I was gone for nearly 2 and a half weeks, it made collaboration and do anything in general for the project virtually impossible. It would have been possible if we had been more prepared on the scrum side of our project. If we had actually structured our plan to make it so that collaboration would be easy, the result would have been way more refined.