linear search in cpp and java is implemnted

cpp-linear-search/cpp-linear-search-4.cpp

@@ -0,0 +1,41 @@
+/*Linear search recursively
+~By Ankush Singh (https://github.com/shad0w1947)~*/
+
+//Header
+#include<iostream>
+using namespace std;
+
+int linearSearch(int *arr,int find,int size,int i)
+{
+  if(i>=size)
+  return -1;
+  if(arr[0]==find)
+  return i;
+  else
+  return linearSearch(arr+1,find,size,i+1);
+}
+
+//main Function
+int main(){
+//enter size of element
+int n,x;
+cout<<"enter number of element :- ";
+cin>>n;
+
+//create dynamic array
+int *arr=new int[n];
+
+for(int i=0;i<n;i++)
+//enter elements
+cin>>arr[i];
+
+cout<<"enter element to be search :-";
+cin>>x;
+
+int ans=linearSearch(arr,x,n,0);
+if(ans==-1)
+cout<<x<<" is not found";
+else
+cout<<x<<" is found at "<<ans<<" index";
+delete(arr);
+}

java-linear-search/.classpath

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="src" path=""/>
+	<classpathentry kind="output" path=""/>
+</classpath>

java-linear-search/.gitignore

@@ -0,0 +1,5 @@
+/Codechef.class
+/JavaLinearSearch3.class
+/JavaLinearSearch4.class
+/LinearSearch.class
+/linearsearch.class

java-linear-search/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>java-linear-search</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

java-linear-search/linearsearch.java

@@ -0,0 +1,38 @@
+//Linear search 
+//~By Ankush Singh (https://github.com/shad0w1947)~
+
+import java.util.*;
+public class linearsearch {
+
+	public static void main(String[] args) {
+		Scanner s=new Scanner(System.in);
+
+		System.out.println("enter size of element");
+		int n=s.nextInt();
+
+		int arr[]=new int[n];
+
+		System.out.println("enter elements");
+		for(int i=0;i<n;i++)
+			arr[i]=s.nextInt();
+
+		int x;
+		System.out.println("enter element to be search");
+		x=s.nextInt();
+
+		boolean check=true;
+		for(int i=0;i<n;i++)
+		{
+			if(arr[i]==x) {
+				System.out.println(x+" is found at index "+i);
+				check=false;
+				break;
+			}
+
+		}
+			if(check)
+				System.out.println(x+" is not found in array");
+
+	}
+
+}