ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

1,482 results

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

45,978 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

353 views

1 year ago

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

35,997 views

8 years ago

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,400,553 views

9 years ago

Introduction to Algorithms and Analysis
Lecture 19 : Randomised Order Statistics

So, now, we will talk about a randomized version of this algorithm this is our select algorithm this is divide and conquer approach ...

28:20
Lecture 19 : Randomised Order Statistics

8,607 views

8 years ago

Probability And Computing - IITM
Discrete Random Variables - Randomized Selection

... the k selection problem which is a generalization of the median problem, ah provided a very simple randomized algorithm ok.

17:10
Discrete Random Variables - Randomized Selection

5,366 views

7 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

Chier Hu
Role of Pivot Elements in Algorithm Efficiency: Randomized Selection Dynamics

how the RANDOMIZED-SELECT algorithm progresses across multiple partitionings. I will focus on which array subsegment still ...

3:48
Role of Pivot Elements in Algorithm Efficiency: Randomized Selection Dynamics

51 views

1 year ago

Chier Hu
Why RANDOMIZED-SELECT Has a Quadratic Worst-Case Time

use a detailed example to explain the concept of worst-case running time for the RANDOMIZED-SELECT algorithm Setup ...

3:31
Why RANDOMIZED-SELECT Has a Quadratic Worst-Case Time

60 views

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

8 years ago

Caseware IDEA
IDEA 10: Random Sampling

IDEA 10: Random Sampling In this section we're going to look at how to pull a random sample from your data. First, ensure the ...

2:14
IDEA 10: Random Sampling

44,516 views

9 years ago

Errichto Algorithms
Randomized algorithms lecture #1 - probability, repeating a process

This is a lecture on randomized algorithms in Competitive Programming. Second part: https://youtu.be/GS2MxmorEzc Codeforces ...

22:09
Randomized algorithms lecture #1 - probability, repeating a process

62,416 views

6 years ago

Chier Hu
RANDOMIZED-SELECT From Base Cases to Recursion

let's consider an array A and the RANDOMIZED-SELECT algorithm to find a specific order statistic. We'll go through the steps of ...

4:12
RANDOMIZED-SELECT From Base Cases to Recursion

197 views

1 year ago

Udacity
Using Randomized Algorithms - Intro to Theoretical Computer Science

This video is part of an online course, Intro to Theoretical Computer Science. Check out the course here: ...

2:22
Using Randomized Algorithms - Intro to Theoretical Computer Science

1,952 views

10 years ago

MIT OpenCourseWare
6. Randomization: Matrix Multiply, Quicksort

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

1:21:52
6. Randomization: Matrix Multiply, Quicksort

67,611 views

9 years ago

Stanford Algorithms
8   2   Randomized Selection    Analysis 21 min
20:35
8 2 Randomized Selection Analysis 21 min

11,810 views

8 years ago

Chier Hu
helpful partitioning pertains to the RANDOMIZED-SELECT to reduce the size of the subarray

The concept of a "helpful" partitioning pertains to the RANDOMIZED-SELECT algorithm's ability to efficiently reduce the size of the ...

3:36
helpful partitioning pertains to the RANDOMIZED-SELECT to reduce the size of the subarray

34 views

1 year ago

Chier Hu
how the pivot is selected impact on RANDOMIZED-SELECT expected running time

delve into the efficiency of the RANDOMIZED-SELECT algorithm, particularly emphasizing the impact of how the pivot is selected ...

3:51
how the pivot is selected impact on RANDOMIZED-SELECT expected running time

193 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,794 views

8 years ago

Khan Academy Labs
Randomized algorithms (intro) | Journey into cryptography | Computer Science | Khan Academy

How could random numbers speed up a decision algorithm? Watch the next lesson: ...

9:23
Randomized algorithms (intro) | Journey into cryptography | Computer Science | Khan Academy

53,706 views

11 years ago