ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

646,056 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,742,747 views

6 years ago

Gate Smashers

2.77M subscribers

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,321,664 views

6 years ago

Gate Smashers
DDA Line Drawing Algorithm in Computer Graphics | Easiest Explanation with examples

In this lecture, Varun Sir explains the DDA (Digital Differential Analyzer) Line Drawing Algorithm with complete clarity and ...

9:00
DDA Line Drawing Algorithm in Computer Graphics | Easiest Explanation with examples

81,352 views

6 months ago

Gate Smashers
Lec-15: What is Heuristic in AI | Why we use Heuristic | How to Calculate Heuristic | Must Watch

Ever wondered what 'heuristic' really means in AI? In this video, Varun sir will break it down in simple words—what it is, why it's so ...

12:57
Lec-15: What is Heuristic in AI | Why we use Heuristic | How to Calculate Heuristic | Must Watch

1,464,628 views

6 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,248,167 views

7 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,899,598 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,431,672 views

6 years ago