ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

1,633 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,231,710 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,056,076 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,051,204 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,165 views

7 years ago

Gate Smashers
Lec-49: BUBBLE SORT in PYTHON 🐍 with Code 👩‍💻 👨‍💻DSA in PYTHON 🐍

Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if ...

10:17
Lec-49: BUBBLE SORT in PYTHON 🐍 with Code 👩‍💻 👨‍💻DSA in PYTHON 🐍

85,681 views

2 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,321,499 views

3 years ago

Gate Smashers
Lec-48: SELECTION SORT in PYTHON 🐍 | DSA Concepts in PYTHON 🐍

Selection sort is another simple sorting algorithm that works by repeatedly finding the minimum (or maximum) element from the ...

10:23
Lec-48: SELECTION SORT in PYTHON 🐍 | DSA Concepts in PYTHON 🐍

74,325 views

2 years ago

Gate Smashers
Lec-53: Quick Sort in Python 🐍 with Code | DSA in Python 🐍

In this video, Varun sir is discussing in detail about Quick sort, which is a popular sorting algorithm based on the ...

12:17
Lec-53: Quick Sort in Python 🐍 with Code | DSA in Python 🐍

58,622 views

2 years ago

Gate Smashers
Lec-47: INSERTION SORT in PYTHON 🐍 | DSA Concepts in Python 🐍

In this video, Varun sir will explain about Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a ...

8:58
Lec-47: INSERTION SORT in PYTHON 🐍 | DSA Concepts in Python 🐍

98,495 views

2 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

61,010 views

2 years ago

Gate Smashers
Lec-64: Topological Order/ Sort in DAG(Direct Acyclic Graph)

Subscribe to our new channel:https://www.youtube.com/@varunainashots ▻Data Structure: ...

6:44
Lec-64: Topological Order/ Sort in DAG(Direct Acyclic Graph)

108,631 views

1 year 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,508,383 views

4 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

758,192 views

5 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

411,009 views

4 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

609,045 views

3 years ago

Gate Smashers
Lec-54: Merge Sort in Python 🐍 with Code | DSA in Python 🐍

In this video, Varun sir will discuss about the Merge sort is a divide-and-conquer algorithm that works by dividing the input array ...

9:33
Lec-54: Merge Sort in Python 🐍 with Code | DSA in Python 🐍

52,032 views

2 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,890 views

4 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,805,618 views

7 years ago

KnowledgeGATE by Sanchit Sir
2.4 Insertion Sort Algorithm | Basic Concepts, Dry Run and Complete Analysis of Insertion Sort

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

15:21
2.4 Insertion Sort Algorithm | Basic Concepts, Dry Run and Complete Analysis of Insertion Sort

48,133 views

3 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,868 views

3 years ago