Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
624,340 results
In this video, Varun sir will break down the basics of what an algorithm is and why it's so important in computer science. You'll also ...
1,623,331 views
6 years ago
In this video, Varun sir will simplify the most important concepts in Algorithm Analysis – Big O, Big Omega (Ω), and Theta (Θ) ...
3,117,412 views
Subscribe to our new channel:https://www.youtube.com/@varunainashots ▻Artificial Intelligence (Complete Playlist): ...
2,543,769 views
n this video, Varun sir will explain Dijkstra's Algorithm step-by-step to help you understand how it finds the shortest path from a ...
3,436,386 views
4 years ago
Greedy techniques are one of the most intuitive and powerful problem-solving approaches in algorithms. In this video, Varun sir ...
1,316,647 views
How complex problems are solved efficiently in computer science? In this video, Varun sir will explain about Divide and Conquer ...
1,091,302 views
A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, undirected graph is a spanning tree ...
2,530,537 views
In this session, Varun sir will introduce you to the world of Design and Analysis of Algorithms (DAA) — a crucial subject for GATE, ...
3,169,606 views
In this video, Varun sir will explain how Quick Sort actually works using simple examples you can easily follow. You'll understand ...
3,356,109 views
In this video, Varun sir will break down the time complexities of all major searching and sorting algorithms—perfectly tailored for ...
1,180,941 views
7 years ago
A spanning tree is a sub-graph of an undirected connected graph, which includes all the vertices of the graph with a minimum ...
1,488,855 views
Confused between Greedy Algorithms and Dynamic Programming? In this video, Varun sir will explain the key differences with ...
1,048,520 views
In the knapsack problem, you need to pack a set of items, with given values and sizes (such as weights or volumes), into a ...
1,851,885 views
Subscribe to our new channel:https://www.youtube.com/@varunainashots Description of RSA Algorithm in Network Security with ...
1,094,761 views
Banker's algorithm is a deadlock avoidance algorithm. It is used in banking systems to determine whether a loan can be granted ...
3,556,235 views
In this video, Varun sir will solve the recurrence relation T(n)= T(n/2) + c in a simplest way possible. This video will give you the ...
1,420,077 views
Huffman Coding is a technique of compressing data to reduce its size without losing any of the details. It was first developed by ...
1,935,840 views
In this lecture, Varun Sir explains the DDA (Digital Differential Analyzer) Line Drawing Algorithm with complete clarity and ...
14,297 views
1 month ago
In this video, Varun sir will explain the Bellman-Ford Algorithm, a powerful technique for finding the shortest path from a single ...
1,048,620 views
In this video, Varun sir will explain what a recurrence relation is, how to write one for Binary Search, and most importantly — how ...
1,676,927 views
![L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm](/api/proxy/image?url=https%3A%2F%2Fi.ytimg.com%2Fvi%2Fx0n75VFd31U%2Fsddefault.jpg)
