Skip to content

docs: add time complexity to merge sort #2818

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
May 19, 2025
Merged

docs: add time complexity to merge sort #2818

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
44ce19e
Update merge_sort.cpp
jiya10208 Oct 12, 2024
9734114
Merge branch 'master' into patch-3
realstealthninja Oct 19, 2024
d63a83b
Merge branch 'master' into patch-3
realstealthninja Oct 28, 2024
99025e1
Merge branch 'master' into patch-3
realstealthninja Nov 1, 2024
1fbb96b
Merge branch 'master' into patch-3
realstealthninja May 19, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion sorting/merge_sort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,10 @@
* Merge Sort is an efficient, general purpose, comparison
* based sorting algorithm.
* Merge Sort is a divide and conquer algorithm
*
* Time Complexity: O(n log n)
* It is same for all best case, worst case or average case
* Merge Sort is very efficient when for the small data.
* In built-in sort function merge sort along with quick sort is used.
*/
#include <iostream>

Expand Down
Loading