solution for: search insert position

Author: edyluisrey

src/leetcode/SearchInsertPosition.java

@@ -7,16 +7,16 @@ public static void main(String[] args){
 	}
 
 	public int searchInsert(int[] nums, int target) {
-        int l=0, h=nums.length-1;              
-        while(l<h){
-        	int mid = (l+h)/2;
-        	if(target> nums[mid]){
-        		l = mid+1;
-        	}else{
-        		h=mid;
-        	}
-        }
-        return h;
-        
-    }
+		int l=0, h=nums.length-1;              
+		while(l<h){
+			int mid = (l+h)/2;
+			if(target> nums[mid]){
+				l = mid+1;
+			}else{
+				h=mid;
+			}
+		}
+		return h;
+	    
+	}
 }