See completeon sorting algorithms here:\rbr\rbr\rbrIn this lesson, we have explained merge sort algorithm. Merge sort is a divide and conquer algorithm that has worst case time complexity of O(nlogn). \rbr\rbrSee source code of real implementation here -\rbr \rbr\rbrFor more such videos and updates, subscribe to our channel.