ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

608,755 results

Gate Smashers
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

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 ...

7:51
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

1,561,218 views

5 years ago

Gate Smashers
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

In this video, Varun sir will simplify the most important concepts in Algorithm Analysis – Big O, Big Omega (Ω), and Theta (Θ) ...

14:25
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

3,011,324 views

5 years ago

Gate Smashers
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

In this video, Varun sir will explain how Quick Sort actually works using simple examples you can easily follow. You'll understand ...

13:27
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

3,239,354 views

5 years ago

Gate Smashers
Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

Subscribe to our new channel:https://www.youtube.com/@varunainashots ▻Artificial Intelligence (Complete Playlist): ...

14:34
Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

2,455,488 views

6 years ago

Gate Smashers
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques

Greedy techniques are one of the most intuitive and powerful problem-solving approaches in algorithms. In this video, Varun sir ...

7:32
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques

1,276,366 views

5 years ago

KnowledgeGATE by Sanchit Sir
Algorithm | Algo in one shot | Complete GATE Course | Hindi #withsanchitsir

KnowledgeGate Website: https://www.knowledgegate.ai For free notes on GATE/PSU/NET subjects, please check out our course: ...

11:09:54
Algorithm | Algo in one shot | Complete GATE Course | Hindi #withsanchitsir

145,293 views

11 months ago

Gate Smashers
L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them

In this video, Varun sir will explain what a recurrence relation is, how to write one for Binary Search, and most importantly — how ...

7:15
L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them

1,612,239 views

5 years ago

Gate Smashers
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example

In this video, Varun sir will explain First Come First Serve (FCFS) which is an operating system scheduling algorithm that ...

10:34
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example

3,712,922 views

7 years ago

Gate Smashers
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA

In this session, Varun sir will introduce you to the world of Design and Analysis of Algorithms (DAA) — a crucial subject for GATE, ...

11:27
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA

3,041,673 views

5 years ago

Gate Smashers
L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

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 ...

15:49
L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

3,299,084 views

4 years ago

Gate Smashers
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

In this video, Varun sir will solve the recurrence relation T(n)= 8T(n/2) + n^2 in a simplest way possible. This video will give you the ...

6:34
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

1,682,028 views

5 years ago

Gate Smashers
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)

Confused between Greedy Algorithms and Dynamic Programming? In this video, Varun sir will explain the key differences with ...

9:08
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)

1,019,002 views

5 years ago

Gate Smashers
L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams

In this video, Varun sir will break down the time complexities of all major searching and sorting algorithms—perfectly tailored for ...

12:52
L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams

1,146,935 views

7 years ago

Gate Smashers
L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm

A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, undirected graph is a spanning tree ...

11:17
L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm

2,432,631 views

5 years ago

Gate Smashers
The Best GATE 2026 Preparation Strategy for TOP Rank

Want a top rank in GATE 2026? Learn the most effective GATE 2026 preparation strategy with smart planning, a subject-wise ...

7:25
The Best GATE 2026 Preparation Strategy for TOP Rank

12,770 views

1 day ago

Gate Smashers
L-3.0: Divide and Conquer | Algorithm

How complex problems are solved efficiently in computer science? In this video, Varun sir will explain about Divide and Conquer ...

4:03
L-3.0: Divide and Conquer | Algorithm

1,054,967 views

4 years ago

Gate Smashers
Lec-18: Random Forest 🌳 in Machine Learning 🧑‍💻👩‍💻

Random Forest is an ensemble learning method that combines multiple decision trees to improve accuracy and prevent overfitting ...

8:33
Lec-18: Random Forest 🌳 in Machine Learning 🧑‍💻👩‍💻

340,883 views

2 years ago

Gate Smashers
L-3.6: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example | Algorithm

In this video, Varun sir will break down the Bubble Sort algorithm in the simplest way possible — with a real example, step-by-step ...

8:34
L-3.6: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example | Algorithm

1,059,384 views

5 years ago

Gate Smashers
L-2.2: Recurrence Relation [ T(n)= T(n/2) + c]  | Substitution Method | Algorithm

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 ...

5:38
L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm

1,355,793 views

5 years ago

Gate Smashers
L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm

In the knapsack problem, you need to pack a set of items, with given values and sizes (such as weights or volumes), into a ...

11:41
L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm

1,792,565 views

5 years ago