ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

173,827 results

0612 TV w/ NERDfirst
Quickselect Algorithm - Find elements by rank without sorting!

How do you quickly find the kth smallest element in a list? While sorting the whole list might be one way of doing it, Quickselect is ...

22:28
Quickselect Algorithm - Find elements by rank without sorting!

5,581 views

8 months ago

BillBird
Algorithm Science (Summer 2025) - 11 - Selection

This video was made as part of a second-year undergraduate algorithms course sequence (Algorithms and Data Structures I and ...

1:24:46
Algorithm Science (Summer 2025) - 11 - Selection

582 views

1 year ago

PurpleMind
Median of Medians: The Smartest Algorithm No One Uses

Go to https://ground.news/landingV8/purplemindcs for a better way to stay informed. Subscribe for 40% off unlimited access to ...

38:30
Median of Medians: The Smartest Algorithm No One Uses

10,507 views

10 months ago

Sebastian Raschka
13.4.4 Sequential Feature Selection (L13: Feature Selection)

Sebastian's books: https://sebastianraschka.com/books/ This video explains how sequential feature selection works. Sequential ...

30:00
13.4.4 Sequential Feature Selection (L13: Feature Selection)

14,251 views

4 years ago

Gaurav Sen
Median of Medians - Order Statistics

Median of Medians is an algorithm to find a good pivot point in sorting and selection algorithms. We first discuss how to find a ...

25:49
Median of Medians - Order Statistics

64,766 views

8 years ago

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

36,467 views

9 years ago

The Inner Circle Trader
ICT Secret To Selecting Algorithmic PD Arrays \ October 14, 2025

Government Required Risk Disclaimer and Disclosure Statement CFTC RULE 4.41 – HYPOTHETICAL OR SIMULATED ...

2:22:46
ICT Secret To Selecting Algorithmic PD Arrays \ October 14, 2025

196,333 views

Streamed 9 months 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,949 views

10 years ago

Algorithms with Attitude
Quick Sort and Quick Select

Table of Contents: 00:00 - Introduction and Prerequisites 00:22 - Quick Sort Concept 01:16 - Quick Sort Pseudocode 1 01:43 ...

21:36
Quick Sort and Quick Select

31,793 views

6 years ago

Krish Naik
Machine Learning Algorithm- Which one to choose for your Problem?

Here is a video which helps you understand which machine learning algorithm you should use for your use case. You can buy my ...

21:33
Machine Learning Algorithm- Which one to choose for your Problem?

240,035 views

7 years ago

Nickvash Kani
Quick-Select Algorithm and Median-of-Medians Lecture

A discussion of the Quick-Select algorithm. In this mini-lecture we go into how the algorithm works overall, and how we enhance ...

35:42
Quick-Select Algorithm and Median-of-Medians Lecture

10,228 views

5 years ago

Ben Langmead
Bitvectors and rank/select

We can use bitvectors to represent sets and sequences. Querying and navigating bitvectors generally comes down to a few basic ...

37:06
Bitvectors and rank/select

5,220 views

6 years ago

Algorithms by Sharma Thankachan
2.2 - Linear Time Selection (Median of Medians Algorithm)

The selection problem asks to report the kth smallest element in an unsorted array. It is easily solvable in O(n log n) time via ...

32:07
2.2 - Linear Time Selection (Median of Medians Algorithm)

32,067 views

5 years ago

CS50
CS50x 2025 - Lecture 3 - Algorithms

Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: O, Ω, ...

2:06:35
CS50x 2025 - Lecture 3 - Algorithms

351,649 views

Streamed 1 year ago

Back To Back SWE
Interval Scheduling Maximization (Proof w/ Exchange Argument)

Try Our Full Platform: https://nas.io/backtobackswe Intuitive Video Explanations ❓New Unseen Questions Get All Solutions ...

20:20
Interval Scheduling Maximization (Proof w/ Exchange Argument)

80,603 views

6 years ago

Simons Institute for the Theory of Computing
Application-Specific Algorithm Selection

Tim Roughgarden, Stanford University Simons Institute Open Lecture Series, Fall 2016 ...

53:39
Application-Specific Algorithm Selection

1,730 views

9 years ago

AI Council
Algorithms for Outlier Selection and One-Class Classification by Jeroen Janssens

More info and slides here: http://www.hakkalabs.com/articles/outlier-selection-and-one-class-classification-by-jeroen-janssens In ...

1:14:28
Algorithms for Outlier Selection and One-Class Classification by Jeroen Janssens

7,471 views

12 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,900,872 views

2 years ago

Patrick Glauner
Algorithms and Data Structures: 11th lecture (selected topics: selection, median of medians)

Topics discussed: - Selected topics: selection, median of medians Find the course syllabus at https://www.glauner.info/teaching.

1:48:39
Algorithms and Data Structures: 11th lecture (selected topics: selection, median of medians)

149 views

3 weeks ago

Mike the Coder
C++ Algorithms and Data Structures: Sorting, Sets, and Selection

What's up guys!! I decided to do another video today and cover Sorting, Sets, and Selection!! I hope you guys enjoy this video!

1:24:03
C++ Algorithms and Data Structures: Sorting, Sets, and Selection

3,313 views

7 years ago