@@ -0,0 +1,25 @@
+//Language: Javascript
+//Author: Tran Lan Anh
+//Github: https://github.com/Lanhbaobao
+
+var binarySearch = function(array, value) {
+    var guess,
+        min = 0,
+        max = array.length - 1;	
+
+    while(min <= max){
+        guess = Math.floor((min + max) /2);
+	if(array[guess] === value)
+	    return guess;
+	else if(array[guess] < value)
+	    min = guess + 1;
+	else
+	    max = guess - 1;	
+     }
+	
+     return -1;
+}
+
+var arr = [2,6,4,1,7,9];
+
+binarySearch(arr, 4);
@@ -0,0 +1,22 @@
+//Language: Javascript
+//Author: Tran Lan Anh
+//Github: https://github.com/Lanhbao
+
+function bubbleSort(arr){
+    for(let i = arr.length-1; i > 0; i--){
+      for(let j = 0; j < i; j++){
+        if(arr[j] >= arr[j+1]){
+          let temp = arr[j];
+          arr[j]=arr[j+1];
+          arr[j+1]=temp;
+        }
+      }
+    }
+    return arr;
+  }
+  //test
+  var arr = [5,2,3,9,0];
+  bubleSort(arr);
+  
+  
+