Minor changes

Author: rampatra

src/me/ramswaroop/arrays/KthLargestElement.java

@@ -52,12 +52,6 @@ public static int getKthLargestElement(int[] a, int k) {
         return maxHeap.findMax();
     }
 
-    private static void swap(int[] a, int firstIndex, int secondIndex) {
-        a[firstIndex] = a[firstIndex] + a[secondIndex];
-        a[secondIndex] = a[firstIndex] - a[secondIndex];
-        a[firstIndex] = a[firstIndex] - a[secondIndex];
-    }
-
     public static void main(String a[]) {
         int[] ar = new int[]{2, 4, 5, 7, 1, 8, 9};
         System.out.println(Arrays.toString(ar));

src/me/ramswaroop/arrays/searching/BinarySearch.java

@@ -3,9 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 9/1/15
- * @time: 4:56 PM
+ * @author ramswaroop
+ * @version 9/1/15
  */
 public class BinarySearch {
 
@@ -18,11 +17,11 @@ public class BinarySearch {
      * @param n
      * @return
      */
-    public static int binarySearch(int a[], int n) {
+    public static int binarySearch(int[] a, int n) {
         return binarySearch(a, n, 0, a.length - 1);
     }
 
-    public static int binarySearch(int a[], int n, int low, int high) {
+    public static int binarySearch(int[] a, int n, int low, int high) {
 
         if (low <= high) {
             int mid = (low + high) / 2;
@@ -44,7 +43,7 @@ public static int binarySearch(int a[], int n, int low, int high) {
      *
      * @param a
      */
-    public static void main(String a[]) {
+    public static void main(String[] a) {
         System.out.println(binarySearch(new int[]{0, 2}, 2));
         System.out.println(binarySearch(new int[]{0, 1, 2, 3}, 2));
         System.out.println(binarySearch(new int[]{0, 1, 2, 3}, 3));

src/me/ramswaroop/java8/Lambdas.java

@@ -0,0 +1,38 @@
+package me.ramswaroop.java8;
+
+import java.util.function.Consumer;
+
+/**
+ * @author ramswaroop
+ * @version 21/02/2017
+ */
+public class Lambdas {
+
+    private int a = 1;
+
+    public void testScopeOfLambda(Consumer<String> consumer) {
+        consumer.accept("Lambda");
+    }
+
+    public static void main(String[] a) {
+        Lambdas l = new Lambdas();
+        l.testScopeOfLambda(x -> System.out.println(x));
+        l.testScopeOfLambda(x -> System.out.println(x + l.a));
+        l.a = 2;
+        l.testScopeOfLambda(x -> System.out.println(x + l.a));
+        /*for (int i = 0; i < 10; i++) {
+            l.testScopeOfLambda(x -> System.out.println(x + i));
+        }*/
+        /*l.testScopeOfLambda(x -> {
+            int a = 2;
+            System.out.println(x + l.a);
+        });*/
+        l.testScopeOfLambda(new Consumer<String>() {
+            int a = 2;
+            @Override
+            public void accept(String s) {
+                
+            }
+        });
+    }
+}

src/me/ramswaroop/java8/Streams.java

@@ -125,7 +125,7 @@ public static Integer[] getAllTransValuesFromTradersInCambridge() {
     public static int findHighestTransactionValue() {
         return transactions.stream()
                 .map(Transaction::getValue)
-                .reduce((t1, t2) -> (t1 > t2) ? t1 : t2) // can replace with .reduce(Integer::max)
+                .reduce((t1, t2) -> (t1 > t2) ? t1 : t2) // you can replace with .reduce(Integer::max)
                 .get();
     }