Skip to content

Latest commit

 

History

History
9 lines (7 loc) · 423 Bytes

README.md

File metadata and controls

9 lines (7 loc) · 423 Bytes

algorithm

insert sort

merge sort

Merge sort is a sorting technique based on divide and conquer technique. With worst-case time complexity being O(nlgn), it is one of the most respected algorithms.