667,434 views 1,533 on YTPak
3,577 105

Published on 02 Jul 2013 | over 3 years ago

See complete series on sorting algorithms here:
www.youtube.com/playlist

In 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).

See source code of real implementation here -
gist.github.com/mycodeschool/9678029

For more such videos and updates, subscribe to our channel.
You may also like us on facebook:
www.facebook.com/MyCodeSchool

Loading related videos...