SEARCHING ALGORITHMS SIMPLIFIED

SEARCH/BSA.cpp

@@ -0,0 +1,20 @@
+/* Binary Search Algorithm*/
+#include<bits/stdc++.h>
+using namespace std;
+int main ()
+{
+long long int n,i,x,ub=9,lb=0,a[201201],mid;
+cin>>x;
+for(i=0;i<10;i++)
+cin>>a[i];
+while(1)
+{
+mid=(lb+ub)/2;
+if(x==mid){
+cout<<mid;return 0;}
+else if(a[mid]>x)
+lb=mid+1;
+else
+ub=mid-1;}
+return 0;
+}

SEARCH/BSRA.cpp

@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+using namespace std;
+int binary(int arr[],int x,int l,int r)
+{int mid;
+if(r>=l){
+mid=l+(r-l)/2;
+if(arr[mid]==x)
+return mid;
+else if(arr[mid]>=x)
+return binary(arr,x,l,mid-1);
+return binary(arr,x,mid+1,r);
+}
+return -1;}
+int main ()
+{
+int i,x,mid,arr[10];
+cin>>x;
+for(i=0;i<10;i++)
+cin>>arr[i];
+mid=binary(arr,x,0,9);
+cout<<"index at"<<mid+1;
+return 0;
+}