updated to es6

Author: lgope

01 - JavaScript-Basics/Arrays.js

@@ -1,6 +1,6 @@
 // Initialize new array
-var names = ['John', 'Mark', 'Jane'];
-var years = new Array(1990, 1969, 1948);
+let names = ['John', 'Mark', 'Jane'];
+let years = new Array(1990, 1969, 1948);
 
 console.log(names[2]); // Jane
 console.log(names.length); // 3
@@ -11,7 +11,7 @@ names[names.length] = 'Mary';
 console.log(names);
 
 // Different data types
-var john = ['John', 'Smith', 1990, 'designer', false];
+let john = ['John', 'Smith', 1990, 'designer', false];
 
 john.push('blue'); // last input
 john.unshift('Mr.'); // first input
@@ -25,5 +25,5 @@ console.log(john);
 console.log(john.indexOf(23)); // -1 [because there is no such index.]
 
 // Ternary Operator
-var isDesigner = john.indexOf('designer') === -1 ? 'John is NOT a designer' : 'John IS a designer';
+let isDesigner = john.indexOf('designer') === -1 ? 'John is NOT a designer' : 'John IS a designer';
 console.log(isDesigner); // John IS a designer

01 - JavaScript-Basics/Functions2.js

@@ -8,7 +8,7 @@
 
 
 // Function expression
-var whatDoYouDo = function (job, firstName) {
+const whatDoYouDo = (job, firstName) => {
     switch (job) {
         case 'teacher':
             return firstName + ' teaches kids how to code';

01 - JavaScript-Basics/emailValidate.js

@@ -1,4 +1,5 @@
-function validateEmail(email) {
+// email regex
+const validateEmail = (email) => {
   const re = /^(([^<>()\[\]\\.,;:\s@"]+(\.[^<>()\[\]\\.,;:\s@"]+)*)|(".+"))@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\])|(([a-zA-Z\-0-9]+\.)+[a-zA-Z]{2,}))$/;
   return re.test(String(email).toLowerCase());
 }

algorithms/binarySearchRecursive.js

@@ -1,19 +1,17 @@
-function binarySearch(arr, val, start = 0, end = arr.length - 1) {
+const binarySearch = (arr, val, start = 0, end = arr.length - 1) => {
   const mid = Math.floor((start + end) / 2);
 
-  if (val === arr[mid]) {
-    return mid;
-  }
+  if (val === arr[mid]) return mid;
 
-  if (start >= end) {
-    return -1;
-  }
+  if (start >= end) return -1;
 
   return val < arr[mid]
     ? binarySearch(arr, val, start, mid - 1)
     : binarySearch(arr, val, mid + 1, end);
-}
+};
 
-let arr = [1, 2, 4, 6, 100, 10000];
+const arr = [1, 9, 5, 7, 2, 4, 8, 6].sort();
 
-console.log(binarySearch(arr, 2));
+const result = binarySearch(arr, 2);
+
+console.log(result !== -1 ? `Element is present at index ${result}` : 'Element is not present in array');