Commit 64642d2

committed

refactor bs

1 parent a957e45 commit 64642d2Copy full SHA for 64642d2

File tree

+28

-20

lines changed

+28

-20

lines changed

Lines changed: 15 additions & 15 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,21 +14,21 @@ Divide and conquer basically does three jobs, first divides the problem into sma`
`14`	`14`
`15`	`15`	`Code Sample`
`16`	`16`	```
`17`		`-func binaySearch(nums[]int, left int, right int, target int,index int) int{`
`18`		`-if(left>right){`
`19`		`-return index`
`20`		`-}`
`21`		`-mid:=(left+right)/2`
`22`		`-if(nums[mid]<target){`
`23`		`-left=mid+1`
`24`		`- index=left`
`25`		`-return binaySearch(nums,left,right,target,index)`
`26`		`-}else if(nums[mid]>target){`
`27`		`-right=mid-1`
`28`		`-return binaySearch(nums,left,right,target,index)`
`29`		`-}else{`
`30`		`-return mid`
`31`		`-}`
	`17`	`+func binaySearch(nums[]int, left int, right int, target int) int{`
	`18`	`+if(left>right){`
	`19`	`+return -1`
	`20`	`+}`
	`21`	`+mid:=(left+right)/2`
	`22`	`+if(nums[mid]<target){`
	`23`	`+left=mid+1`
	`24`	`+`
	`25`	`+return binaySearch(nums,left,right,target)`
	`26`	`+}else if(nums[mid]>target){`
	`27`	`+right=mid-1`
	`28`	`+return binaySearch(nums,left,right,target)`
	`29`	`+}else{`
	`30`	`+return mid`
	`31`	`+}`
`32`	`32`	`}`
`33`	`33`	```
`34`	`34`

Lines changed: 13 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,17 +1,25 @@`
`1`	`1`	`package algorithm`
`2`	`2`
`3`		`-func binaySearch(nums[]int, left int, right int, target int,index int) int{`
	`3`	`+//func main(){`
	`4`	`+// int_arr:= []int{2, 4, 5, 7,9, 15, 21}`
	`5`	`+// k:=15`
	`6`	`+//`
	`7`	`+// log.Print(binaySearch(int_arr,0,6,k))`
	`8`	`+//`
	`9`	`+//}`
	`10`	`+`
	`11`	`+func binaySearch(nums[]int, left int, right int, target int) int{`
`4`	`12`	`if(left>right){`
`5`		`- return index`
	`13`	`+ return -1`
`6`	`14`	`}`
`7`	`15`	`mid:=(left+right)/2`
`8`	`16`	`if(nums[mid]<target){`
`9`	`17`	`left=mid+1`
`10`		`-index=left`
`11`		`- return binaySearch(nums,left,right,target,index)`
	`18`	`+`
	`19`	`+ return binaySearch(nums,left,right,target)`
`12`	`20`	`}else if(nums[mid]>target){`
`13`	`21`	`right=mid-1`
`14`		`- return binaySearch(nums,left,right,target,index)`
	`22`	`+ return binaySearch(nums,left,right,target)`
`15`	`23`	`}else{`
`16`	`24`	`return mid`
`17`	`25`	`}`

Comments

(0)