Create 35. Search Insert Position

Author: ravisksingh1999

35. Search Insert Position

@@ -0,0 +1,34 @@
+class Solution {
+public:
+    int searchInsert(vector<int>& nums, int target) {
+
+
+        int mid;
+        int s=1;
+        int e=nums.size()-1;
+
+
+        mid=s+(e-s)/2;
+        
+        while(s<=e)
+        {
+            if((nums[mid]>target && nums[mid-1]<target)||
+               nums[mid]== target)
+
+               return mid;
+               else if(nums[mid]> target)
+               e=mid-1;
+               else
+               s=mid+1;
+
+                 mid=s+(e-s)/2;
+        }
+        
+        if(mid==1) 
+        {
+            if(target>nums[0]) return 1;
+            else return 0;
+        }
+return mid;
+    }
+};