Added Bubble Sort - Easy

MichaelVandi · MichaelVandi · commit 27d902c61109 · 2020-08-02T22:01:33.000-04:00
diff --git a/Easy/08_02_2020_bubble_sort.java b/Easy/08_02_2020_bubble_sort.java
@@ -0,0 +1,29 @@
+/*
+    Time:
+        Best = O(n), Average = O(n^2), Worst = O(n^2)
+    Space: O(1)
+*/
+class Solution {
+    public int[] sortArray(int[] nums) {
+        // Assume the array is not sorted
+        boolean isSorted = false;
+        while (!isSorted) {
+            isSorted = true;
+            for (int i = 0; i < nums.length - 1; i++) {
+                // If current number is greater than the next
+                if (nums[i] > nums[i + 1]) {
+                    // Swap them
+                    swap(nums, i, i + 1);
+                    // If we made a swap, then let's go through one more iteration
+                    isSorted = false;
+                }
+            }
+        }
+        return nums;
+    }
+    public void swap(int[] array, int i, int j) {
+        int temp = array[i];
+        array[i] = array[j];
+        array[j] = temp;
+    }
+}
