Commit 21a49ab

authored

Update Readme.md

1 parent 9e39f4f commit 21a49abCopy full SHA for 21a49ab

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@ The idea is to break the the array into an non-overlapping set of elements (sub-`
`8`	`8`
`9`	`9`	`## Time Complexity`
`10`	`10`
`11`		`-`
	`11`	`+One way to look at it that, we are partitioning the array into two parts each time, resulting into O(logn) partition steps ,in average case/best case and O(n) partition steps in worst case, when all the elements are on one side of randomly chosen pivot. We observe that each of these partition steps has O(n) elements to be sorted. Hence,`
`12`	`12`
`13`	`13`	`Best Case: O(nlogn)`
`14`	`14`

Comments

(0)