Commit e81eb77

authored

Update README.md

1 parent 67920b4 commit e81eb77Copy full SHA for e81eb77

File tree

-0

lines changed

-0

lines changed

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -12,6 +12,8 @@ Divide and conquer basically does three jobs, first divides the problem into sma`
`12`	`12`
`13`	`13`	`The pre-requisites of binary search is, the array needs to be sorted.`
`14`	`14`
	`15`	+ Time complexity: ``` O(log n) ```
	`16`	`+`
`15`	`17`	`Code Sample`
`16`	`18`	```
`17`	`19`	`func binaySearch(nums[]int, left int, right int, target int) int{`
`@@ -36,6 +38,13 @@ func binaySearch(nums[]int, left int, right int, target int) int{`
`36`	`38`	`- Merge Sort`
`37`	`39`	`- Quick Sort`
`38`	`40`
	`41`	`+Time complexity:`
	`42`	+```
	`43`	`+O(n log n) in avg. case`
	`44`	`+O(n2) int the worst case.`
	`45`	+```
	`46`	`+Supports in-place.`
	`47`	`+`
`39`	`48`	`Code Sample`
`40`	`49`
`41`	`50`	```xml

Comments

(0)