This repository has been archived by the owner on Apr 1, 2021. It is now read-only.
updated merge-sort #1086
Merged
updated merge-sort #1086
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
ghost
self-assigned this
| @@ -2,7 +2,7 @@ | |||
|
|
|||
| Most modern languages have an inbuilt sort() function which automatically sorts an input array or list. Did you ever wonder how the sort function actually works on the inside?. Knowing common sorting algorithms and their implementations is the most important part of a coding interview. In this series of articles, we will look at several important sorting algorithms. How they are implemented, the time and space complexity etc. Our very first post is on Merge Sort. | |||
|
|
|||
| ## | |||
| ## | |||
There was a problem hiding this comment.
-##
+## we need the two spaces next to ##
so it will look like this:
instead of this:
With the space it is not visible but still does the job for the chat.
LGTM 👍 |
| @@ -13,36 +13,124 @@ To learn about Merge Sort, a basic knowledge about [Recursion](http://programmer | |||
| The biggest advantage of using Merge sort is that the [time complexity](https://www.youtube.com/watch?v=V42FBiohc6c&list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn) is only n*log(n) to sort an entire Array. It is a lot better than n^2 running time of bubble sort or insertion sort. | |||
| Before we write the JavaScript code, let us understand how merge sort works with the help of a diagram. | |||
|
|
|||
| ![alt tag] (https://i67.tinypic.com/2ahe49y.png) | |||
| ![Merge Sort] (https://i67.tinypic.com/2ahe49y.png) | |||
There was a problem hiding this comment.
-![Merge Sort] (https://i67.tinypic.com/2ahe49y.png)
+
| @@ -13,36 +13,124 @@ To learn about Merge Sort, a basic knowledge about [Recursion](http://programmer | |||
| The biggest advantage of using Merge sort is that the [time complexity](https://www.youtube.com/watch?v=V42FBiohc6c&list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn) is only n*log(n) to sort an entire Array. It is a lot better than n^2 running time of bubble sort or insertion sort. | |||
| Before we write the JavaScript code, let us understand how merge sort works with the help of a diagram. | |||
|
|
|||
| ![alt tag] (https://i67.tinypic.com/2ahe49y.png) | |||
|  | |||
There was a problem hiding this comment.
Please change the link to https://i.imgur.com/ac98ccu.png
That link is not working, I uploaded the image to the one I just posted.
-
+
|
Thanks @jainaman224 |
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
#1048