From 44ce19e06765a06da4ed5bf5ac01713a8ad168a4 Mon Sep 17 00:00:00 2001 From: jiya <122276932+jiya10208@users.noreply.github.com> Date: Sat, 12 Oct 2024 13:09:41 +0530 Subject: [PATCH] Update merge_sort.cpp --- 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 74087491bef..c2a9fde7c19 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