added bogo sort algo

searches/exponential_search.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+
+int binarySearch(int arr[], int, int, int); 
+
+int exponentialSearch(int arr[], int n, int x) 
+{ 
+
+    if (arr[0] == x) 
+        return 0; 
+    int i = 1; 
+    while (i < n && arr[i] <= x) 
+        i = i*2; 
+
+
+    return binarySearch(arr, i/2, min(i, n), x); 
+} 
+
+
+int binarySearch(int arr[], int l, int r, int x) 
+{ 
+    if (r >= l) 
+    { 
+        int mid = l + (r - l)/2; 
+
+        if (arr[mid] == x) 
+            return mid; 
+
+        if (arr[mid] > x) 
+            return binarySearch(arr, l, mid-1, x); 
+
+        return binarySearch(arr, mid+1, r, x); 
+    } 
+
+
+    return -1; 
+} 
+
+
+int main(void) 
+{ 
+   int arr[] = {2, 3, 4, 10, 40}; 
+   int n = sizeof(arr)/ sizeof(arr[0]); 
+   int x = 10; 
+   int result = exponentialSearch(arr, n, x); 
+   (result == -1)? printf("Element is not present in array") 
+                 : printf("Element is present at index %d", 
+                                                    result); 
+   return 0; 
+} 

sorting/bogo_sort.cpp

@@ -0,0 +1,47 @@
+
+
+#include<bits/stdc++.h> 
+using namespace std; 
+
+
+bool isSorted(int a[], int n) 
+{ 
+    while ( --n > 1 ) 
+        if (a[n] < a[n-1]) 
+            return false; 
+    return true; 
+} 
+
+
+void shuffle(int a[], int n) 
+{ 
+    for (int i=0; i < n; i++) 
+        swap(a[i], a[rand()%n]); 
+} 
+
+
+void bogosort(int a[], int n) 
+{ 
+
+    while ( !isSorted(a, n) ) 
+        shuffle(a, n); 
+} 
+
+
+void printArray(int a[], int n) 
+{ 
+    for (int i=0; i<n; i++) 
+        printf("%d ", a[i]); 
+    printf("\n"); 
+} 
+
+
+int main() 
+{ 
+    int a[] = {3, 2, 5, 1, 0, 4}; 
+    int n = sizeof a/sizeof a[0]; 
+    bogosort(a, n); 
+    printf("Sorted array :\n"); 
+    printArray(a,n); 
+    return 0; 
+}