| Rank | Lecture videos | Main concepts |
| 1 | Course introduction | Sorting, Merge sort, Search algorithm, Algorithm, Spanning tree, Sorting algorithm | 5 | Quick union improvements | Path compression, Linear time, Log, Connected component, Node, Constructor | 11 | Theory of algorithms | Theory of algorithms, Constant time, Big theta, Big o, Worst case, Binary search | 16 | Generics | Generics, Generic, Generic type, Type checking, Data type, Bug | 20 | Selection sort | Selection sort, Array, Quadratic time, Sorting, For loop, Pointer | 25 | Merge sort | Merge sort, Sort, Stable sort, Recursion, Loop, Sequence | 29 | Stability | Insertion sort, Selection sort, Sorting algorithm, Shell Sort, Sort, Merge sort | 32 | Duplicate keys | Sort, Merge sort, Quick sort, Time complexity, Pointer, Array | 36 | Heapsort | Heap, Sorting algorithms, Heap sort, Heap data structure, Max heap, Binary heap | 48 | Line segment intersection | Priority queue, Binary search tree, N log n, Brute force method, Interval, Binary search |
|
|