diff --git a/BINARYSE.CPP b/BINARYSE.CPP
new file mode 100644
index 0000000..64ed875
--- /dev/null
+++ b/BINARYSE.CPP
@@ -0,0 +1,42 @@
+#include<conio.h>
+#include<iostream.h>
+void main()
+{       clrscr();
+	int n,item,a[21], flag=1,first,last,middle;
+	cout<<"\nEnter no.of elements:";
+	cin>>n;
+	cout<<"\nEnter the elements:";
+	for(int i=0;i<n;i++)
+	{
+		cin>>a[i];
+	}
+	cout<<"\nenter element to be searched:";
+	cin>>item;
+	first=0;
+	last=n-1;
+	middle=(first+last)/2;
+	while(first<=last)
+	{
+		if(a[middle]<item)
+		{
+			first=middle+1;
+		}
+		else if(a[middle]==item)
+		{
+			cout<<"\n element found at pos:"<<middle+1;
+			flag=0;
+			break;
+
+		}
+		else
+		{
+			last=middle-1;
+		}
+		middle=(first+last)/2;
+	}
+	if(flag==1)
+	{
+		cout<<"\nelement not found" ;
+	}
+	getch();
+}
\ No newline at end of file
diff --git a/LINEARSE.CPP b/LINEARSE.CPP
new file mode 100644
index 0000000..fd8c915
--- /dev/null
+++ b/LINEARSE.CPP
@@ -0,0 +1,30 @@
+#include<conio.h>
+#include<iostream.h>
+void main()
+{
+	 clrscr();
+	 int a[11],n,i,k,flag=0;
+	 cout<<"\nEnter the no.of elements:";
+	 cin>>n;
+	 cout<<"\nEnter the elements:";
+	 for(i=0;i<n;i++)
+	 {
+		cin>>a[i];
+	 }
+	 cout<<"\nEnter the element to be searched:";
+	 cin>>k;
+	 for(i=0;i<n;i++)
+	 {
+		if(a[i]==k)
+		{
+			cout<<"\nElement found at position:"<<i+1;
+			flag=1;
+			break;
+		}
+	 }
+	 if(flag==0)
+	 {
+		cout<<"\n Element not found...";
+	 }
+	 getch();
+}
\ No newline at end of file