ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

151,303 results

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

36,045 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,054 views

9 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,023 views

5 years ago

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!

3,341 views

2 months ago

Data Science with Marco
Feature selection in machine learning | Full course

Full source code on GitHub: https://github.com/marcopeix/youtube_tutorials/blob/main/YT_01_feature_selection.ipynb Introduction ...

46:41
Feature selection in machine learning | Full course

44,794 views

2 years ago

Easy Theory
Linear-Time Median Algorithm (Making Quicksort go Fast!)

Here we show that we can find the median of an array (or in general, the kth smallest element) in linear time, versus just sorting ...

38:48
Linear-Time Median Algorithm (Making Quicksort go Fast!)

9,560 views

5 years 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,763 views

2 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

9,923 views

5 years ago

DigitalSreeni
155 - How many hidden layers and neurons do you need in your artificial neural network?

No one can give a definite answer to the question about number of neurons and hidden layers. This is because the answer ...

24:06
155 - How many hidden layers and neurons do you need in your artificial neural network?

62,851 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,382 views

8 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,918 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?

237,119 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)

29,683 views

5 years ago

Arpit Bhayani
The Piece Selection algorithm that makes BitTorrent fault tolerant

System Design for SDE-2 and above: https://arpitbhayani.me/masterclass System Design for Beginners: ...

23:18
The Piece Selection algorithm that makes BitTorrent fault tolerant

4,009 views

3 years ago

The Tech Granth
Find the k th Smallest/Largest Element | Quick Select Algorithm | Optimizing Quick Sort

Finding Kth largest and smallest element of an array in an Optimized way is common software coding interview question asked in ...

24:28
Find the k th Smallest/Largest Element | Quick Select Algorithm | Optimizing Quick Sort

20,478 views

4 years ago

Ghassan Shobaki Computer Science Lectures
Algorithms Lecture 15: Greedy Algorithms, Activity Selection Problem

California State University, Sacramento Spring 2018 Algorithms by Ghassan Shobaki Text book: Introduction to Algorithms by ...

1:11:32
Algorithms Lecture 15: Greedy Algorithms, Activity Selection Problem

12,485 views

7 years 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

9,411 views

4 months 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,419 views

5 years ago

DataTalksClub ⬛
Feature Selection in Machine Learning with Python - Soledad Galli

Links: - Train in Data Website: https://www.trainindata.com/ - Github: https://github.com/solegalli/DataTalks.Club2022 ML ...

1:09:22
Feature Selection in Machine Learning with Python - Soledad Galli

7,153 views

Streamed 3 years ago

IIT Madras - B.S. Degree Programme
W8L5_Divide and Conquer  Quick Select

Divide and Conquer-Quick Select IIT Madras welcomes you to the world's first BSc Degree program in Programming and Data ...

27:28
W8L5_Divide and Conquer Quick Select

9,757 views

4 years ago