Done using Binary search

Author: gs146

Search Insert position

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