ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

2,500 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,691 views

7 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,110 views

9 years 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,638 views

10 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,928 views

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

9 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

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,497 views

6 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-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,320,057 views

6 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,243 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,674 views

8 years ago

Numberphile
Stable Marriage Problem - Numberphile

Discuss on Reddit: http://redd.it/2fgu97 More links & stuff in full description below ↓↓↓ Featuring Dr Emily Riehl. Continues with ...

8:37
Stable Marriage Problem - Numberphile

954,859 views

11 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,257 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,095,096 views

4 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,181,441 views

6 years ago

GeeksforGeeks
Closest Pair of Points | Divide and Conquer | GeeksforGeeks

Find Complete Code at GeeksforGeeks Article: http://www.geeksforgeeks.org/closest-pair-of-points/ This video is contributed by ...

8:44
Closest Pair of Points | Divide and Conquer | GeeksforGeeks

283,476 views

8 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

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,127,061 views

6 years ago

mycodeschool
Time and space complexity analysis of recursive programs - using factorial

See complete series on recursion here http://www.youtube.com/playlist?list=PL2_aWCzGMAwLz3g66WrxFGSXvSsvyfzCO We ...

8:03
Time and space complexity analysis of recursive programs - using factorial

486,905 views

13 years ago