ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

143,151 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,563,146 views

5 years ago

GeeksforGeeks and GeeksforGeeks GATE
Get 55+ Marks Easily in GATE CS 2026 using this strategy

Are you preparing for GATE CS and aiming to score 55+ marks? Follow these proven strategies to ace the exam effortlessly: ...

7:03
Get 55+ Marks Easily in GATE CS 2026 using this strategy

107,277 views

11 months ago

GeeksforGeeks
Time and Space Complexity explained in literally 5 minutes | Big O | Concepts made simple ep -1

Time and Space Complexity Explained in Literally Minutes! | Concepts Made Simple Ep -1 Confused about time and space ...

5:43
Time and Space Complexity explained in literally 5 minutes | Big O | Concepts made simple ep -1

170,225 views

1 year 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,278,210 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,244,365 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,014,511 views

5 years ago

Infinite Codes
All Machine Learning algorithms explained in 17 min

All Machine Learning algorithms intuitively explained in 17 min ######################################### I just started ...

16:30
All Machine Learning algorithms explained in 17 min

1,692,154 views

1 year 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,147,838 views

7 years 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,056,134 views

4 years ago

Techdose
Linear search vs Binary search

This video explains the 3 basic and the most important differences between the linear search and binary search along with the ...

4:16
Linear search vs Binary search

375,784 views

6 years ago

Abdul Bari
1.5.1 Time Complexity #1

Finding Time Complexity of Different kind of snippets PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on ...

9:44
1.5.1 Time Complexity #1

2,950,100 views

7 years ago

Sajjaad Khader
Data Structures Explained for Beginners - How I Wish I was Taught

Data structures are essential for coding interviews and real-world software development. In this video, I'll break down the most ...

15:51
Data Structures Explained for Beginners - How I Wish I was Taught

699,182 views

9 months ago

Abdul Bari
6 Introduction to Backtracking - Brute Force Approach

Introduction to Backtracking PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

8:15
6 Introduction to Backtracking - Brute Force Approach

1,631,981 views

7 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,020,577 views

5 years ago

KnowledgeGATE by Sanchit Sir
Types of Analysis of Algorithm | Average Best and Worst case Analysis of Algorithm | Time Complexity

Please message us on WhatsApp: https://wa.me/918000121313 KnowledgeGate Website: https://www.knowledgegate.in/gate ...

9:57
Types of Analysis of Algorithm | Average Best and Worst case Analysis of Algorithm | Time Complexity

77,975 views

3 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,045,567 views

5 years ago

Abdul Bari
2.8.1  QuickSort Algorithm

Quick Sort Algorithm Explained PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

13:43
2.8.1 QuickSort Algorithm

3,810,859 views

7 years ago

Abdul Bari
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search

Breadth First Search Depth First Search PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

18:31
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search

4,629,937 views

7 years 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,614,118 views

5 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,684,223 views

5 years ago