diff --git a/Languages/BinarySearching.c b/Languages/BinarySearching.c
new file mode 100644
index 0000000..81c20bb
--- /dev/null
+++ b/Languages/BinarySearching.c
@@ -0,0 +1,47 @@
+#include<stdio.h>
+#include<conio.h>
+void main()
+{
+	int a[100],i,n,key,flag=0,beg,end,mid;
+	printf("enter total element in list");
+	scanf("%d",&n);
+	printf("enter %d element in ascending order \n",n);
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);	
+	}
+	printf("enter the element you  want to search \n");
+	scanf("%d",&key);
+	beg=0;end=n-1;mid=-1;
+	while(a[mid]!=key&&beg<=end)
+	{ 
+	   if(mid=(beg+end)/2)
+		{
+			flag =1;
+			break;	
+		}
+		else
+		{
+			if(a[mid]<key)
+			{
+				beg=mid+1;
+			}
+			else
+			{
+				end=mid-1;
+			}
+		}
+		
+	}
+	if(flag==1)
+	{
+		printf("searched element found!!");
+		
+	}
+	else
+	{
+	printf("searched element not found");
+	}
+	getch();
+	
+}
diff --git a/Languages/BinarySearching.exe b/Languages/BinarySearching.exe
new file mode 100644
index 0000000..3ab6886
Binary files /dev/null and b/Languages/BinarySearching.exe differ
diff --git a/Languages/Print%d.c b/Languages/Print%d.c
new file mode 100644
index 0000000..496b7f5
--- /dev/null
+++ b/Languages/Print%d.c
@@ -0,0 +1,6 @@
+#include<stdio.h>;
+#include<conio.h>
+void main()
+{
+	printf("%%d");
+}
diff --git a/Languages/Print%d.exe b/Languages/Print%d.exe
new file mode 100644
index 0000000..e7a04bd
Binary files /dev/null and b/Languages/Print%d.exe differ
diff --git a/Languages/sum.c b/Languages/sum.c
new file mode 100644
index 0000000..8ca1e86
--- /dev/null
+++ b/Languages/sum.c
@@ -0,0 +1,18 @@
+#include<stdio.h>
+#include<conio.h>
+void main()
+{
+	int i,sum=0;
+	for(i=100;i<200;i++)
+	{
+		if(sum%7==0)
+		{
+		sum=sum+i;
+		}
+		
+		
+
+	}
+	printf("sum is %d",sum);
+}
+
diff --git a/Languages/sum.exe b/Languages/sum.exe
new file mode 100644
index 0000000..880fe58
Binary files /dev/null and b/Languages/sum.exe differ