ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

88,145 results

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,406,196 views

9 years ago

Chier Hu
Quicksort vs. RANDOMIZED-SELECT: Selecting the i-th Order Statistic

The RANDOMIZED-SELECT algorithm provides a way to find the i-th smallest element in an array. Let's walk through the ...

6:34
Quicksort vs. RANDOMIZED-SELECT: Selecting the i-th Order Statistic

370 views

1 year 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

276,854 views

1 year ago

Stanford Algorithms
8   3   Deterministic Selection   Algorithm Advanced   Optional 17 min
16:57
8 3 Deterministic Selection Algorithm Advanced Optional 17 min

15,805 views

8 years ago

Microsoft Developer
How do you select the right machine learning algorithm? (25 of 28)

A common question in data science is "Which machine learning algorithm should I use?". In this video you will learn how the ...

3:46
How do you select the right machine learning algorithm? (25 of 28)

2,760 views

5 years ago

Learn with Whiteboard
All Major Feature Selection Methods in Machine Learning Explained

Learn basic understanding of each major feature selection algorithms. - Acquire practical insights into implementing these ...

11:32
All Major Feature Selection Methods in Machine Learning Explained

17,727 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,390,479 views

9 years ago

Back To Back SWE
Find the k'th Largest or Smallest Element of an Array: From Sorting To Heaps To Partitioning

Code & Problem Statement ...

29:13
Find the k'th Largest or Smallest Element of an Array: From Sorting To Heaps To Partitioning

278,785 views

6 years ago

Learn with Whiteboard
How To Choose the Right Feature Selection Method For ML Problem

In this video, we're diving deep into the crucial aspect of how to choose the perfect feature selection method for your ML problem.

4:23
How To Choose the Right Feature Selection Method For ML Problem

8,739 views

1 year ago

StatQuest with Josh Starmer
Machine Learning Fundamentals: Cross Validation

One of the fundamental concepts in machine learning is Cross Validation. It's how we decide which machine learning method ...

6:05
Machine Learning Fundamentals: Cross Validation

1,382,999 views

7 years ago

udiprod
Insertion Sort vs Bubble Sort + Some analysis

A visual demonstration of insertion sort, competition with bubble sort, and performance analysis including these two and quick sort ...

5:17
Insertion Sort vs Bubble Sort + Some analysis

353,076 views

8 years ago

MIT OpenCourseWare
R4. Randomized Select and Randomized Quicksort

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

39:30
R4. Randomized Select and Randomized Quicksort

46,028 views

9 years ago

GeeksforGeeks
Greedy Algorithms | Set 1 (Activity Selection Problem) | GeeksforGeeks

Explanation for the article: http://www.geeksforgeeks.org/greedy-algorithms-set-1-activity-selection-problem/ Read More: ...

5:06
Greedy Algorithms | Set 1 (Activity Selection Problem) | GeeksforGeeks

389,807 views

8 years ago

Stanford Algorithms
8   1   Randomized Selection   Algorithm 22 min
21:40
8 1 Randomized Selection Algorithm 22 min

36,030 views

8 years ago

Development Days
Floyd Rivest algorithm | Kth smallest algorithm | Quick Select Algorithm

Floyd-Rivest Algorithm A selection algorithm developed by Robert W. Floyd and Ronald L. to find kth smallest element.

11:53
Floyd Rivest algorithm | Kth smallest algorithm | Quick Select Algorithm

518 views

3 years ago

Chier Hu
linear expected running time of the RANDOMIZED-SELECT algorithm and why it is effective on average

the linear expected running time of the RANDOMIZED-SELECT algorithm and explains why it is effective on average despite the ...

3:44
linear expected running time of the RANDOMIZED-SELECT algorithm and why it is effective on average

122 views

1 year ago

Josh Hug
CS61b Spring 2023 - Lec 31 - Sorting 3: Quicksort, Quick Select, Stability

Simple algorithm, actually. And that's the fastest known median selection algorithm. Is it as mathematically beautiful as BFPRT four ...

49:48
CS61b Spring 2023 - Lec 31 - Sorting 3: Quicksort, Quick Select, Stability

4,753 views

2 years ago

Sebastian Raschka
11.6 Nested CV for Algorithm Selection Code Example (L11 Model Eval. Part 4)

Sebastian's books: https://sebastianraschka.com/books/ Picking up where the previous video left off, this video goes over nested ...

24:35
11.6 Nested CV for Algorithm Selection Code Example (L11 Model Eval. Part 4)

6,406 views

5 years ago

Introduction to Algorithms and Analysis
Lecture 20 : Worst case linear time order statistics

So we have seen the select algorithm and randomized select algorithm where basically the problem is to find the i th smallest ...

27:56
Lecture 20 : Worst case linear time order statistics

12,371 views

8 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,729,021 views

9 years ago