text stringlengths 1 81 | start float64 0 10.1k | duration float64 0 24.9 |
|---|---|---|
then and now? | 1,285.646 | 0.589 |
AUDIENCE: Yes. | 1,286.235 | 0.365 |
SPEAKER 1: OK. | 1,286.6 | 0.583 |
So that's J. What happens next? | 1,287.183 | 1.567 |
AUDIENCE: [INAUDIBLE]. | 1,292.7 | 1.677 |
SPEAKER 1: OK. | 1,294.377 | 0.583 |
That's K. K, L, good. | 1,294.96 | 3.77 |
B, that's easy. | 1,298.73 | 0.91 |
On top. | 1,299.64 | 0.55 |
A, even easier. | 1,300.19 | 1.02 |
On top. | 1,301.21 | 1.036 |
AUDIENCE: Am I going to
finish this entire thing? | 1,302.246 | 1.314 |
SPEAKER 1: Yes. | 1,303.56 | 0.74 |
We need 13 more, give or take. | 1,304.3 | 2.498 |
M and-- | 1,306.798 | 0.952 |
AUDIENCE: N. | 1,307.75 | 0.5 |
SPEAKER 1: N, O. I didn't
do a very good job there. | 1,308.25 | 3.51 |
U, V. OK, definitely not good. | 1,311.76 | 2.97 |
Y. That's good. | 1,314.73 | 1.06 |
It goes toward the end. | 1,315.79 | 1.01 |
R, a little harder. | 1,316.8 | 2.77 |
But this is actually a
good situation for us | 1,319.57 | 1.92 |
to be in because-- you keep
going, I'll keep talking. | 1,321.49 | 2.208 |
So even as Allison is
sorting this, she's | 1,323.698 | 2.682 |
dealing with each of these
blue books one at a time. | 1,326.38 | 2.25 |
But notice what's happening
to her right hand. | 1,328.63 | 2.14 |
There literally is more and more work,
it seems, happening in her right hand | 1,330.77 | 3.77 |
because as she encounters R or now W,
not only does she need more thought, | 1,334.54 | 3.58 |
she also needs to do more
flipping to actually find | 1,338.12 | 2.41 |
the right spot for W. This is H.
She's doing the same thing again. | 1,340.53 | 2.98 |
So it feels like the algorithm
has started to slow down. | 1,343.51 | 3.3 |
At first, it was pretty easy
to just make a short list. | 1,346.81 | 2.61 |
But now that the list
is getting longer, it | 1,349.42 | 2.01 |
feels like she's fixing a lot of
work, or finding a location is | 1,351.43 | 3.91 |
getting harder and harder. | 1,355.34 | 2.49 |
Or at least taking longer and longer. | 1,357.83 | 1.83 |
Maybe the alphabet itself is
not that much more difficult. | 1,359.66 | 2.51 |
Now, we have I. I can
only stall so much longer. | 1,362.17 | 3.01 |
G. | 1,365.18 | 0.5 |
AUDIENCE: Sorry. | 1,365.68 | 0.29 |
SPEAKER 1: No, that's fine. | 1,365.97 | 1.125 |
E, good. | 1,367.095 | 0.505 |
OK. | 1,367.6 | 0.5 |
So it's getting a little easier
because we're at the beginning. | 1,368.1 | 3.28 |
Sorted. | 1,371.38 | 0.77 |
So what were you thinking? | 1,372.15 | 1.39 |
What was that algorithm? | 1,373.54 | 1.255 |
AUDIENCE: It was just take a
letter, take another letter, | 1,374.795 | 2.375 |
and then test to see if the
letter is before or after. | 1,377.17 | 3.294 |
SPEAKER 1: OK, good. | 1,380.464 | 0.833 |
AUDIENCE: And then put it in the
correct place on either side. | 1,381.297 | 2.103 |
SPEAKER 1: Perfect. | 1,383.4 | 0.43 |
So a perfect way of
thinking about this as well. | 1,383.83 | 1.82 |
So thank you so much. | 1,385.65 | 0.945 |
AUDIENCE: Thank you. | 1,386.595 | 0.405 |
SPEAKER 1: Very nicely done. | 1,387 | 1.166 |
And suppose the problem's
a little harder. | 1,388.166 | 2.144 |
I'll do this one myself here. | 1,390.31 | 2.21 |
But suppose we have some playing cards. | 1,392.52 | 2.22 |
And these are the type that
probably everyone here can see. | 1,394.74 | 3.42 |
So here is a standard
deck of cards, including | 1,398.16 | 4.09 |
the jokers, which we won't need. | 1,402.25 | 1.636 |
How do you go about
sorting things like this? | 1,403.886 | 1.874 |
I don't know if-- actually,
I didn't think in advance. | 1,405.76 | 4.88 |
I should have shuffled these. | 1,410.64 | 1.88 |
So if you want to shuffle these cards. | 1,412.52 | 2.35 |
This is not going to end well. | 1,414.87 | 2.11 |
OK. | 1,416.98 | 0.73 |
So suppose we have all of these
cards nicely shuffled here. | 1,417.71 | 3.45 |
And I have before me a big
problem, a big pile of cards. | 1,421.16 | 3.215 |
And the goal, for whatever reason,
you wanted to start the game | 1,424.375 | 2.625 |
or you like to be orderly,
is to sort the cards. | 1,427 | 2.1 |
What's your algorithm going
to be for sorting these cards? | 1,429.1 | 4.081 |
What might you do? | 1,433.181 | 0.749 |
Yeah. | 1,437.56 | 0.702 |
AUDIENCE: [INAUDIBLE]. | 1,438.262 | 0.916 |
SPEAKER 1: Do them in
piles based on the number. | 1,441.651 | 1.999 |
OK, so here's the number 2. | 1,443.65 | 1.51 |
So you want to make a
pile for all the 2's? | 1,445.16 | 2.02 |
OK, so we can do that. | 1,447.18 | 1.19 |
So here's a pile for all the 4's. | 1,448.37 | 1.467 |
And let me make myself some more room. | 1,449.837 | 1.583 |
So we can put 2's here. | 1,451.42 | 1.2 |
4's here. | 1,452.62 | 0.77 |
Here's a 3. | 1,453.39 | 0.584 |
So I'm going to put this
in between the 2 and the 4. | 1,453.974 | 2.166 |
Here's a 5. | 1,456.14 | 0.96 |
I'm going to put that over here. | 1,457.1 | 1.43 |
And if I jump around, here's a Jack. | 1,458.53 | 1.52 |
So this is going to go way over there. | 1,460.05 | 2.09 |
7, 8. | 1,462.14 | 1 |
6 can go over here. | 1,463.14 | 1.59 |
Here's another 4, so I can put it here. | 1,464.73 | 2.83 |
And I can bucketize all of the cards. | 1,467.56 | 2.47 |
So this is good intuition because it
makes a pretty big problem, 52 cards, | 1,470.03 | 4.11 |
a little more tenable. | 1,474.14 | 1.149 |
You can just now flip through
all of the cards one at a time, | 1,475.289 | 2.541 |
or whatever you encounter first. | 1,477.83 | 1.53 |
And just drop it in the correct bucket. | 1,479.36 | 2.01 |
But that's, of course, not
going to get you to the end. | 1,481.37 | 2.291 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.