Please Login To Continue
Merge Sort (in Hindi)
Lesson 4 of 10 • 8 upvotes • 12:49mins
Akansha Aggarwal
Merge Sort is based in divide and conquer technique.In this algorithm ,array is divided into 2 different arrays at every step and then the sorting is done in smaller arrays.
(Hindi) Sorting Algorithms for GATE
10 lessons • 2h 9m
1
Selection Sort (in Hindi)
13:39mins
2
Bubble Sort (in Hindi)
11:28mins
3
Insertion Sort (in Hindi)
12:22mins
4
Merge Sort (in Hindi)
12:49mins
5
Heap Sort (in Hindi)
13:52mins
6
Quick Sort (in Hindi)
14:40mins
7
Counting Sort and Radix Sort (in Hindi)
12:50mins
8
Previous Year GATE Questions-Part 1(in Hindi)
14:09mins
9
Previous Year GATE Questions-Part 2(in Hindi)
15:00mins
10
Previous Year GATE Questions-Part 3 (in Hindi)
8:41mins
Crack GATE & ESE with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
