Merging 2 arrays without extra space

In this video you will learn how to Merge 2 Sorted Arrays without using any extra space using 2 approaches.

• 1:34 : Approach 1 (Direct) : TC O(n*m)
• 7:00 : Approach 2 (Efficient) : TC O((n+m)log(n+m))

Comparison of ALL Sorting Algorithms

In this video you will learn how all sorting algorithms differ from one another (Time , Space, Comparison , Swaps , Size of Array , Online Data , Stability , Almost sorted array, LinkedList ) and in what all seniors which sorting algorithm should be choose.

Why Build Heap works in O(n) | Mathematical proof

In this video you will get to see the mathematical proof that why Build Heap method works in O(n). In order to learn more about heaps.

• 2:00 : Approach 1 TC O(n^2) SC(1)
• 5:30 : Approach 2 TC O(n) SC(n)
• 11:05 : Approach 3 TC O(n) SC(n)