Merge sort with better time complexity

Nikhil-2002 / Programming_Hactoberfest23

9 stars 75 forks source link

Merge sort with better time complexity #42

Closed vaishnavin01 closed 1 year ago

vaishnavin01 commented 1 year ago

Description: Added a merge sort algorithm. merge sort is a type of divide and conquer method with the time-complexity of (O(nlogn)) which is much better than other sorting Algorithms

vaishnavin01 commented 1 year ago

I like to working on this .

vaishnavin01 commented 1 year ago

please add hactoberfest label for it