update on sorting algorithms

Author: Blooverh

DataAndAlgoL/Chpt10SortingAlgorithms/Bubblesort.java

@@ -20,20 +20,20 @@ public static void bubbleSort(int[] array){
     }
 
     //O(n) Improved bubble sort Best possible complexity
-    public static void bubbleSort2(int[] arr){
-        int temp;
-        int swapped=1; //flag to check whether its needs to be swapped meaning it is not sorted
-        for(int i= arr.length-1; i>=0 /* && swapped */; i--){
-            swapped=0;
-            for(int j=0; j<=arr.length; j++){
-                if(arr[i] >arr[i+1]){
-                    //swap elements
-                    temp= arr[i];
-                    arr[i]=arr[i+1];
-                    arr[i+1]=temp;
-                    swapped=1;
-                }
-            }
-        }
-    }
+    // public static void bubbleSort2(int[] arr){
+    //     int temp;
+    //     int swapped=1; //flag to check whether its needs to be swapped meaning it is not sorted
+    //     for(int i= arr.length-1; i>=0 /* && swapped */; i--){
+    //         swapped=0;
+    //         for(int j=0; j<=arr.length; j++){
+    //             if(arr[i] >arr[i+1]){
+    //                 //swap elements
+    //                 temp= arr[i];
+    //                 arr[i]=arr[i+1];
+    //                 arr[i+1]=temp;
+    //                 swapped=1;
+    //             }
+    //         }
+    //     }
+    // }
 }

DataAndAlgoL/Chpt10SortingAlgorithms/Chpt10Notes.org

@@ -19,6 +19,7 @@
         Bubble sort continues its iterations until no more swaps are needed.
         Has high complexity time and is too Simplest
         ** Only significant advantage of bubble sort is detecting whether input list is sorted or not 
+        complexity = O(n^2)
 
     ** SELECTION SORT
         *** Works well for small files. Used to sort very large values with very small keys. Because selecyion is made based on keys and swaps are made only when required 
@@ -32,7 +33,7 @@
             2. swap it with the value in the current position
             3. repeat process for all elements until the entire array is sorted
 
-    ** INSERTION SORT 
+    ** INSERTION SORT !! -> WATCH VIDEO ABOUT INSERTION SORT
         simple and efficient comparison sort. 
         ** Each iteration removes an element from the input data and inserts it into the correct position in the list being sorted. 
             ** The choice of the element being removed from the input is random and this process is repeated until all elements are sorted.
@@ -48,4 +49,4 @@
             - Every repetition of insertion removes an element from the input data, and inserts it into the correct position in the already sorted list until no input elements remain.
             - Sorting is typically done in-place. The resulting array after k iterations has the property where the first k+1 entries are sorted 
 
-PAGE -> 514
+    ** SHELL SORT (DIMINISHING INCREMENT SORT)

DataAndAlgoL/Chpt10SortingAlgorithms/InsertionSort.java

@@ -11,9 +11,9 @@ public static void main(String[] args) {
     public static void insertionSort(int[] arr){
 
         for(int i=1; i<arr.length; i++){
-            int v=arr[i]; // holds value of key i
-            int j=i-1; // holds key i
-            // while previous key is > and v (current key) and j >=1, assign arr[j] with previous value arr[j-1]
+            int v=arr[i]; // holds value of index i
+            int j=i-1; // holds index i-1
+            // while previous index is > and v (current index value) and j >=1, assign arr[j] with previous value arr[j-1]
             while(arr[j] > v && j >= 0){
                 arr[j+1] = arr[j];
                 j--; // decrement j by 1 to previous position arr[j-1]

DataAndAlgoL/Chpt10SortingAlgorithms/SelectionSort.java

@@ -13,7 +13,10 @@ public static void main(String[] args) {
     public static void selectionSort(int[] nums){
         int min; // Stores minimum value in list 
         int temp; // holds values for swappage 
-
+        /*
+         * Called Selection sort because every j iteration selects the minimum value 
+         * to swap with element at i position
+         */
         for(int i=0; i < nums.length-1; i++){
             min=i;
             for(int j= i+1; j< nums.length; j++){ //for each iteration, goes through all the array starting at i and compares j to current min