From 3f6876f03fd8dbe62f59c64e499c0d8b2ee7427b Mon Sep 17 00:00:00 2001 From: jiya <122276932+jiya10208@users.noreply.github.com> Date: Mon, 19 May 2025 17:13:50 +0530 Subject: [PATCH] Update merge_sort.cpp (#2818) Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com> --- sorting/merge_sort.cpp | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/sorting/merge_sort.cpp b/sorting/merge_sort.cpp index 74087491b..c2a9fde7c 100644 --- a/sorting/merge_sort.cpp +++ b/sorting/merge_sort.cpp @@ -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