ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

415 results

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,230,613 views

5 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,055,670 views

5 years ago

Gate Smashers
L-3.7: Insertion Sort | Time Complexity Analysis | Stable Sort | Inplace Sorting

In this video, Varun sir will explain about Insertion Sort — a simple yet powerful sorting algorithm. You'll learn how it works ...

15:32
L-3.7: Insertion Sort | Time Complexity Analysis | Stable Sort | Inplace Sorting

1,050,825 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,145,045 views

7 years ago

Gate Smashers
L-3.3: How Merge Sort Works?? Full explanation with example

The “Merge Sort” uses a recursive algorithm to achieve its results. The divide-and-conquer algorithm breaks down a big problem ...

9:52
L-3.3: How Merge Sort Works?? Full explanation with example

1,320,955 views

3 years ago

Gate Smashers
Shortcut for Swaps🔁 in Bubble🫧 Sorting📶| Best Case | Worst Case

Confused about how many swaps happen in Bubble Sort? In this video, Varun sir will give you a shortcut trick to calculate swaps ...

3:06
Shortcut for Swaps🔁 in Bubble🫧 Sorting📶| Best Case | Worst Case

37,254 views

2 years ago

Gate Smashers
L-3.8: Selection Sort | Time Complexity(Best, Avg & Worst) Analysis | Stable or Not | Inplace or Not

In this video, Varun sir will break down Selection Sort in the simplest way possible! Understand how it works step-by-step, and ...

11:37
L-3.8: Selection Sort | Time Complexity(Best, Avg & Worst) Analysis | Stable or Not | Inplace or Not

757,854 views

5 years ago

Gate Smashers
L-3.18: Heap sort with Example | Heapify Method

In this video, Varun sir explains Heap Sort in the simplest way possible — using real examples to show how the Heapify method ...

13:38
L-3.18: Heap sort with Example | Heapify Method

1,507,707 views

4 years ago

Gate Smashers
Optimized Bubble Sort | Best Case | O(n) Time Complexity | Sorting Algorithms |DAA

In this video, Varun sir will break down the Optimized Bubble Sort algorithm, focusing on its best-case performance of O(n).

8:32
Optimized Bubble Sort | Best Case | O(n) Time Complexity | Sorting Algorithms |DAA

60,999 views

2 years ago

Michael Sambol
Insertion sort in 2 minutes

Step by step instructions showing how to run insertion sort.

2:19
Insertion sort in 2 minutes

1,719,333 views

9 years ago

Gate Smashers
L- 6.8:Topological Sorting with examples | Topological Sorting using DFS

In this video, Varun sir has discussed about Topological Sorting—a key concept in graph theory, especially useful for tasks like ...

11:33
L- 6.8:Topological Sorting with examples | Topological Sorting using DFS

563,757 views

3 years ago

Gate Smashers
L-3.2: Performance of Quick Sort | Worst Case Time Complexity with Example | Algorithm

In this video, Varun sir explains the Worst Case Time Complexity of Quick Sort with a simple, real-life example to help you truly ...

8:16
L-3.2: Performance of Quick Sort | Worst Case Time Complexity with Example | Algorithm

903,003 views

5 years ago

Gate Smashers
L-3.9: Radix Sort | Easiest explanation with example

Radix sort is a non-comparative sorting algorithm that is used to sorts the data in lexicographical (dictionary) order. It uses ...

6:05
L-3.9: Radix Sort | Easiest explanation with example

608,739 views

3 years ago

Gate Smashers
Lec-15: Binary Search in Data Structure by #Naina Mam

Subscribe to our new channel:https://www.youtube.com/@varunainashots Binary search looks for a particular item by comparing ...

10:33
Lec-15: Binary Search in Data Structure by #Naina Mam

477,003 views

4 years ago

Michael Sambol
Bubble sort in 2 minutes

Step by step instructions showing how to run bubble sort.

2:10
Bubble sort in 2 minutes

1,248,672 views

9 years ago

Gate Smashers
Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity

Subscribe to our new channel:https://www.youtube.com/@varunainashots In computer science, a linear search or sequential ...

12:28
Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity

410,821 views

4 years ago

Gate Smashers
Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST

Subscribe to our new channel:https://www.youtube.com/@varunainashots 0:00 - Introduction 0:25 -Creation of Binary search tree ...

11:02
Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST

1,594,898 views

5 years ago

Gate Smashers
L-3.11: Bucket Sort | Easiest explanation with examples | Time Complexity analysis with Pseudocode

Bucket Sort is a sorting algorithm that divides the unsorted array elements into several groups called buckets. Each bucket is then ...

10:21
L-3.11: Bucket Sort | Easiest explanation with examples | Time Complexity analysis with Pseudocode

414,656 views

3 years ago

Gate Smashers
L -3.4: Merge Sort Pseudocode | Merge Sort with example

In this video, Varun sir will explain the pseudocode of Merge Sort in the simplest way possible — with a clear step-by-step ...

8:09
L -3.4: Merge Sort Pseudocode | Merge Sort with example

672,203 views

3 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,052,682 views

4 years ago

Gate Smashers
L-3.10: Counting Sort | Easiest explanation with example

In this video, Varun sir will break it down in the simplest way possible — step by step with an easy-to-follow example. Whether ...

7:37
L-3.10: Counting Sort | Easiest explanation with example

516,158 views

3 years ago

Michael Sambol
Selection sort in 3 minutes

Step by step instructions showing how to run selection sort.

2:43
Selection sort in 3 minutes

1,399,405 views

9 years ago

Gate Smashers
L-4.7: What is Spanning Tree with Examples in Hindi | Algorithm

A spanning tree is a sub-graph of an undirected connected graph, which includes all the vertices of the graph with a minimum ...

7:12
L-4.7: What is Spanning Tree with Examples in Hindi | Algorithm

1,431,614 views

5 years ago

Gate Smashers
Time complexity and Comparison of All Data Structures

Subscribe to our new channel:https://www.youtube.com/@varunainashots 0:00 -Introduction 0:55 -Unsorted Array 2:12 -Sorted ...

8:13
Time complexity and Comparison of All Data Structures

142,864 views

4 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,272,832 views

5 years ago