Please Login To Continue
Divide and Conquer : Merge Sort
Lesson 8 of 17 • 7 upvotes • 10:22mins
Kruthi Shankar Hegde
Divide and Conquer techniques. Explanation about Merge Sort in detail.
Design Analysis of Algorithms for GATE (CS and IT)
17 lessons • 2h 43m
1
Overview
2:56mins
2
Introduction to Algorithm
10:09mins
3
Algorithm Designing Techniques
8:30mins
4
Algorithm Analysis
9:36mins
5
How to find Time Complexity
10:00mins
6
Asymptotic Notations
10:00mins
7
Brute Force : Linear Search, Selection Sort
10:47mins
8
Divide and Conquer : Merge Sort
10:22mins
9
Decrease and Conquer : Binary Search
10:18mins
10
Greedy Technique : Prim's Algorithm
9:22mins
11
Greedy Algorithm : Kruskal's Algorithm
9:57mins
12
Problem solving for GATE
7:50mins
13
Master's Theorem
11:22mins
14
Master's theorem : Problem solving
10:05mins
15
Dijkstra Algorithm
10:34mins
16
Problem solving : Dijkstra Algorithm
11:24mins
17
Warshall algorithm
9:47mins
Crack GATE - Iconic Pro with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
