Searching Algorithm(linear , interpolation)

CPP/Interpolation_Search.cpp

@@ -0,0 +1,44 @@
+//program to perform binary search
+//By me fiirst must be 0 or else first element will not be uncountered.
+#include<stdio.h>
+#include<conio.h>
+int main()
+{
+	int n,arr[100],i,search,flag=0;
+	printf("Enter the size of the array \n");
+	scanf("%d",&n);
+	printf("Enter  the array such that elements are sorted and eqidistance.\n");
+	for (i=0;i<n;i++)
+	{
+		scanf("%d",&arr[i]);
+	}
+	printf("Enter the no. to searched \n");
+	scanf("%d",&search);
+	int first =0,last=n-1,mid=0,pos=0;
+	while(first<=last)
+	{
+		mid=(first+(last-first)*(search-arr[first]))/(arr[last]-arr[first]);
+		if(arr[mid] == search)
+		{
+			flag=1;
+			pos=mid;
+			break;
+		}
+		if(arr[mid]<search)
+		{
+			first=mid+1;
+		}
+		else
+		{
+			last=mid-1;
+		}
+	}
+	if (flag==1)
+	{
+		printf("Search is successful and element is present at %d ",pos+1);
+	}
+	else
+	{
+		printf("Element not found");
+	}
+}

CPP/Linear_Search.cpp

@@ -0,0 +1,31 @@
+//prograam to perform linear search
+#include<stdio.h>
+int main()
+{
+	int n,arr[100],i,search,flag=0;
+	printf("Enter the size of the array \n");
+	scanf("%d",&n);
+	printf("Enter  the array \n");
+	for (i=0;i<n;i++)
+	{
+		scanf("%d",&arr[i]);
+	}
+	printf("Enter the no. to searched \n");
+	scanf("%d",&search);
+	for(i=0;i<n;i++)
+	{
+		if(search == arr[i])
+		{
+			flag =1;
+			break;
+		}
+	}
+	if (flag == 1)
+	{
+		printf("Search is successful and element is present at %d \n ",i+1);
+	}
+	else
+	{
+		printf("Sorry element not found \n");
+	}
+}