Asymptotic Notations, Introduction to Merge Sort Algorithm

Lesson 2 of 9 • 1 upvotes • 7:42mins

Ayushman Tiwari

Asymptotic Notations are used to compare two non-negative functions on the basis of their growth rates. The three asymptotic Notations have been explained in this lesson. A brief introduction to Merge Sort Algorithm is being done. Developed by John Von Neumann in 1945, Merge Sort follows the Divide & Conquer technique to sort the unsorted list.