diff --git a/hello_world/Autoit/hello_world.au3 b/hello_world/Autoit/hello_world.au3
new file mode 100644
index 000000000..b32c97516
--- /dev/null
+++ b/hello_world/Autoit/hello_world.au3
@@ -0,0 +1 @@
+MsgBox(0, "Say Hi", "Hello World")
diff --git a/searching/binary_search/javascript/binarySearch.js b/searching/binary_search/javascript/binarySearch.js
new file mode 100644
index 000000000..ebe32011f
--- /dev/null
+++ b/searching/binary_search/javascript/binarySearch.js
@@ -0,0 +1,37 @@
+<script>
+// JavaScript program to implement recursive Binary Search
+  
+// A recursive binary search function. It returns
+// location of x in given array arr[l..r] is present,
+// otherwise -1
+function binarySearch(arr, l, r, x){
+    if (r >= l) {
+        let mid = l + Math.floor((r - l) / 2);
+  
+        // If the element is present at the middle
+        // itself
+        if (arr[mid] == x)
+            return mid;
+  
+        // If element is smaller than mid, then
+        // it can only be present in left subarray
+        if (arr[mid] > x)
+            return binarySearch(arr, l, mid - 1, x);
+  
+        // Else the element can only be present
+        // in right subarray
+        return binarySearch(arr, mid + 1, r, x);
+    }
+  
+    // We reach here when element is not
+    // present in array
+    return -1;
+}
+  
+let arr = [ 2, 3, 4, 10, 40 ];
+let x = 10;
+let n = arr.length
+let result = binarySearch(arr, 0, n - 1, x);
+(result == -1) ? document.write( "Element is not present in array")
+                   : document.write("Element is present at index " +result);
+</script>