diff --git a/Search.java b/Search.java
new file mode 100644
index 0000000..29c2486
--- /dev/null
+++ b/Search.java
@@ -0,0 +1,23 @@
+public class Main
+{
+	public static void main(String[] args) {
+	int arr[]={-5,6,7,12,34};//input array 
+	int target=23;//target element 
+	int low=0;
+	int high=arr.length-1;
+	while(low<=high){
+	    int midp=(low+high)/2;
+	    int midnum=arr[midp];
+	    if(target==midnum){
+	        System.out.print(midp); //if element present in the array return the index number 
+	    }
+	    else if(midnum<target){
+	        low=midp+1;
+	    }
+	    else{
+	        high=midp-1;
+	    }
+	}
+	System.out.print(low); //if the target element not found insert the position it should be placed 
+	}
+}
diff --git a/searchtarget b/searchtarget
new file mode 100644
index 0000000..ea30834
--- /dev/null
+++ b/searchtarget
@@ -0,0 +1,31 @@
+
+class Sol{
+  public int search(int[]nums,int target){
+int low=0;  //using binary search
+int high=nums.length-1;
+while(low<=high){
+int midp=(low+high)/2;
+int midnum=nums[midp];
+if(midnum==target){
+return midp;
+}
+else if(nums[low]<=midnum){
+if(nums[low]<=target&&target<midnum){
+high=midp-1;
+}
+else{
+low=midp+1;
+}
+}
+else{
+if(midnum<=target&&target<nums[high]){
+low=midp+1;
+}
+else{
+high=midp-1;
+}
+}
+return -1;//if the target is not found it will return -1;
+
+}
+}