ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

4,318 results

Rman
What is the Master Theorem?

When we had the more efficient algorithm, where we had only three sub-problems instead of four, we then got a solution of O(n to ...

4:57
What is the Master Theorem?

173,677 views

7 years ago

Udacity
Algorithmic Design Goals

This video is part of the Udacity course "High Performance Computing". Watch the full course at ...

1:21
Algorithmic Design Goals

296 views

9 years ago

MIT OpenCourseWare
2. Divide & Conquer: Convex Hull, Median Finding

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:20:35
2. Divide & Conquer: Convex Hull, Median Finding

223,753 views

9 years ago

Michael Sambol
Dijkstra's algorithm in 3 minutes

Step by step instructions showing how to run Dijkstra's algorithm on a graph.

2:46
Dijkstra's algorithm in 3 minutes

1,977,185 views

11 years ago

GeeksforGeeks
Introduction to Greedy Algorithms | GeeksforGeeks

Explanation for the article: http://www.geeksforgeeks.org/greedy-algorithms-set-1-activity-selection-problem/ This video is ...

5:32
Introduction to Greedy Algorithms | GeeksforGeeks

845,087 views

9 years ago

Coding with Lewis
10 Sorting Algorithms Easily Explained

Every programmer has run into sorting algorithms at one point in their career. ‍ In today's video I am going to explain 10 ...

10:48
10 Sorting Algorithms Easily Explained

293,891 views

1 year ago

Michael Sambol
Ford-Fulkerson in 5 minutes

Step by step instructions showing how to run Ford-Fulkerson on a flow network.

5:15
Ford-Fulkerson in 5 minutes

1,162,596 views

10 years ago

Michael Sambol
Prim's algorithm in 2 minutes

Step by step instructions showing how to run Prim's algorithm on a graph.

2:17
Prim's algorithm in 2 minutes

1,506,376 views

13 years ago

Michael Sambol
Merge sort in 3 minutes

Step by step instructions showing how to run merge sort. Code: https://github.com/msambol/dsa/blob/master/sort/merge_sort.py ...

3:03
Merge sort in 3 minutes

1,604,844 views

9 years ago

MIT OpenCourseWare
2.11.1 Stable Matching: Video

MIT 6.042J Mathematics for Computer Science, Spring 2015 View the complete course: http://ocw.mit.edu/6-042JS15 Instructor: ...

11:20
2.11.1 Stable Matching: Video

54,544 views

9 years ago

LearnFree
Computer Science Basics: Algorithms

We use computers every day, but how often do we stop and think, “How do they do what they do?” This video series explains ...

2:30
Computer Science Basics: Algorithms

687,011 views

7 years ago

Nikhil Lohia
Brute Force algorithms with real life examples | Study Algorithms

Super helpful resources available here: https://nikoo28.github.io/all-my-links/ To see more videos like this, you can buy me a ...

6:54
Brute Force algorithms with real life examples | Study Algorithms

144,682 views

5 years ago

MIT OpenCourseWare
16. Complexity: P, NP, NP-completeness, Reductions

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:25:25
16. Complexity: P, NP, NP-completeness, Reductions

477,442 views

9 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,767,470 views

9 years ago

CSE Guru
Transform & Conquer Technique Introduction | L 127 | Design & Analysis of Algorithm

transform and conquer #transformandconquerinada #transformandconquerindaa #transform&conquer ...

10:46
Transform & Conquer Technique Introduction | L 127 | Design & Analysis of Algorithm

6,782 views

1 year 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,050,487 views

6 years ago

WIRED
Harvard Professor Explains Algorithms in 5 Levels of Difficulty | WIRED

From the physical world to the virtual world, algorithms are seemingly everywhere. David J. Malan, Professor of Computer Science ...

25:47
Harvard Professor Explains Algorithms in 5 Levels of Difficulty | WIRED

4,781,534 views

2 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,319,985 views

6 years ago

Michael Sambol
Quick sort in 4 minutes

Step by step instructions showing how to run quick sort. Code: https://github.com/msambol/dsa/blob/master/sort/quick_sort.py ...

4:24
Quick sort in 4 minutes

2,427,769 views

9 years ago

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,629,129 views

6 years ago

Abdul Bari
6.1 N Queens Problem using Backtracking

N-Queens problem state space tree PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

13:41
6.1 N Queens Problem using Backtracking

2,714,648 views

8 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,095,023 views

4 years ago

Abdul Bari
4.9 Longest Common Subsequence (LCS)  - Recursion and Dynamic Programming

Longest Common Subsequence Problem using 1. Recursion 2. Memoization 3. Dynamic Programming PATREON ...

23:35
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

1,455,472 views

7 years ago

Learn with Whiteboard
What is Pseudocode Explained | How to Write Pseudocode Algorithm | Examples, Benefits & Steps

Wondering what is pseudocode in programming? Well, we use pseudocode in various fields of programming, whether it be app ...

4:39
What is Pseudocode Explained | How to Write Pseudocode Algorithm | Examples, Benefits & Steps

430,188 views

3 years ago

THE GATEHUB
Introduction to Algorithm and Properties | GATECSE | DAA

algorithm, #daa, #designandanalysisofalgorithms , #gatecse, #thegatehub introduction to algorithms || characteristics of algorithm ...

11:46
Introduction to Algorithm and Properties | GATECSE | DAA

385,781 views

4 years ago