anuraghcoder23
diff --git a/‎lectures/10-binary search/code/src/com/kunal/RBS.java
Lines changed: 2 additions & 2 deletions b/‎lectures/10-binary search/code/src/com/kunal/RBS.java
Lines changed: 2 additions & 2 deletions
diff --git a/‎lectures/11-sorting/Bubble Sort.pdf
1.71 MB b/‎lectures/11-sorting/Bubble Sort.pdf
1.71 MB
diff --git a/‎lectures/11-sorting/Selection Sort.pdf
428 KB b/‎lectures/11-sorting/Selection Sort.pdf
428 KB
diff --git a/‎lectures/11-sorting/code/src/com/kunal/Main.java
Lines changed: 27 additions & 2 deletions b/‎lectures/11-sorting/code/src/com/kunal/Main.java
Lines changed: 27 additions & 2 deletions
@@ -2,8 +2,8 @@
 // https://leetcode.com/problems/search-in-rotated-sorted-array/submissions/
 public class RBS {
     public static void main(String[] args) {
-        int[] arr = {4,5,6,7,0,1,2};
-        System.out.println(findPivot(arr));
+        int[] arr = {1,2,3,4,5,5,6};
+        System.out.println(findPivotWithDuplicates(arr));
     }
 
     static int search(int[] nums, int target) {
 
@@ -5,11 +5,36 @@
 public class Main {
 
     public static void main(String[] args) {
-        int[] arr = {3, 1, 5, 4, 2};
-        bubble(arr);
+        int[] arr = {4, 5, 1, 2, 3};
+        selection(arr);
         System.out.println(Arrays.toString(arr));
     }
 
+    static void selection(int[] arr) {
+        for (int i = 0; i < arr.length; i++) {
+            // find the max item in the remaining array and swap with correct index
+            int last = arr.length - i - 1;
+            int maxIndex = getMaxIndex(arr, 0, last);
+            swap(arr, maxIndex, last);
+        }
+    }
+
+    static void swap(int[] arr, int first, int second) {
+        int temp = arr[first];
+        arr[first] = arr[second];
+        arr[second] = temp;
+    }
+
+    static int getMaxIndex(int[] arr, int start, int end) {
+        int max = start;
+        for (int i = start; i <= end; i++) {
+            if (arr[max] < arr[i]) {
+                max = i;
+            }
+        }
+        return max;
+    }
+
     static void bubble(int[] arr) {
         boolean swapped;
         // run the steps n-1 times