Please Login To Continue
Decrease and Conquer: Binary Search(in Hindi)
Lesson 9 of 20 • 2 upvotes • 12:03mins
Kruthi Shankar Hegde
Detailed explanation of decrease and conquer Binary search: Implementation, Algorithm, Time complexity
(Hindi) Design and Analysis of Algorithms for GATE
20 lessons • 3h 20m
1
OVERVIEW (in Hindi)
10:15mins
2
Introduction To Algorithm (in Hindi)
9:32mins
3
Algorithm Designing Techniques (in Hindi)
10:38mins
4
Algorithm Analysis(in Hindi)
9:10mins
5
How To Find Time Complexity(in Hindi)
10:25mins
6
Asymptotic Analysis(in Hindi)
10:12mins
7
Brute Force : Linear Search, Selection Sort(in Hindi)
9:57mins
8
Divide and Conquer : Merge Sort(in Hindi)
10:35mins
9
Decrease and Conquer: Binary Search(in Hindi)
12:03mins
10
Greedy Technique : Prim's Algorithm(in Hindi)
9:37mins
11
Greedy Technique: Kruskal's Algorithm(in Hindi)
10:25mins
13
Problem Solving for Gate(in Hindi)
9:40mins
14
Master's Theorem for GATE(in Hindi)
9:29mins
15
Problems on Master's Theorem(in Hindi)
9:47mins
16
Dijkstra Algorithm(in Hindi)
8:19mins
17
Problems on Dijkstra for GATE(in Hindi)
10:30mins
18
Warshall Algorithm(in Hindi)
11:54mins
19
Decrease and conquer: Insertion Sort(in Hindi)
8:25mins
20
Decrease and Conquer: Breadth First Search
11:09mins
21
Depth First Search (in Hindi)
8: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
