add examples

Author: amejiarosario

package-lock.json

@@ -0,0 +1,16 @@
+/**
+ * Get the smallest number on an array of numbers
+ * @param {Array} n array of numbers
+ */
+function getMin(n = []) {
+  let min = n[0];
+
+  n.forEach(element => {
+    if(element < min) {
+      min = element;
+    }
+  });
+  return min;
+}
+
+module.exports = getMin;

src/algorithms/get-min.js

@@ -0,0 +1,19 @@
+const getMin = require('./get-min');
+
+describe('find smallest number', () => {
+  it('should get the min number of an array', () => {
+    expect(getMin([3, 10, 2])).toEqual(2);
+  });
+
+  it('should get the min number of an array with negatives', () => {
+    expect(getMin([3, 10, -2])).toEqual(-2);
+  });
+
+  it('should work with 0', () => {
+    expect(getMin([3, 0, 2])).toEqual(0);
+  });
+
+  it('should work with empty', () => {
+    expect(getMin([])).toEqual(undefined);
+  });
+});

src/algorithms/get-min.spec.js

@@ -18,7 +18,7 @@ function binarySearchRecursive(array, search, offset = 0) {
 
   if (current === search) {
     return offset + half;
-  } if (array.length < 2) {
+  } if (array.length === 1) {
     return -1;
   } if (search > current) {
     const right = array.slice(half);

src/runtimes/02-binary-search.js

@@ -0,0 +1,29 @@
+const binarySearch = require('./02-binary-search').binarySearchRecursive;
+
+describe('Binary Search', () => {
+  let array;
+
+  beforeEach(() => {
+    array = [7, 9, 13, 23];
+  });
+
+  it('should find a middle element', () => {
+    expect(binarySearch(array, 9)).toEqual(1);
+  });
+
+  it('should find an first element', () => {
+    expect(binarySearch(array, 7)).toEqual(0);
+  });
+
+  it('should find the last element', () => {
+    expect(binarySearch(array, 23)).toEqual(3);
+  });
+
+  it('should not find an bigger element', () => {
+    expect(binarySearch(array, 9000)).toEqual(-1);
+  });
+
+  it('should find a smaller element', () => {
+    expect(binarySearch(array, -9)).toEqual(-1);
+  });
+});