Commit e5e462d

authored

Update Readme.md

1 parent fcb6e0b commit e5e462dCopy full SHA for e5e462d

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,24 @@`
`1`	`1`	`# Merge Sort`
	`2`	`+`
	`3`	`+Merge Sort is a fast sorting algorithm based on Divide and Conquer Approach .`
	`4`	`+`
	`5`	`+## Algorithm`
	`6`	`+`
	`7`	`+Merge Sort Algorithm divides the given sequence of numbers into two parts (and keeps on dividing until we have just one single element), sorts them and then merges them effectively to produce an entire sorted array.In order to understand this algorithm, watch this short and awesome video https://www.youtube.com/watch?v=EeQ8pwjQxTM`
	`8`	`+`
	`9`	`+## Time Complexity`
	`10`	`+`
	`11`	`+Average Case : O(nlogn)`
	`12`	`+Best Case: O(nlogn)`
	`13`	`+Worst Case: O(n^2)`
	`14`	`+`
	`15`	`+## Space Complexity`
	`16`	`+`
	`17`	`+Requires an Auxillary Space of order O(n)`
	`18`	`+`
	`19`	`+## Comparision with Quick Sort Algorithm`
	`20`	`+`
	`21`	`+Is Merge Sort faster or slower than Quick Sort ?`
	`22`	`+To know the answer, watch https://www.youtube.com/watch?v=es2T6KY45cA`
	`23`	`+`
	`24`	`+`

Comments

(0)