Transcript Table
Note: Lines that are metadata or do not contain timestamps are greyed out and do not have active links.
Results of Search: 176,291 lines — Showing 18501 - 18520.
| Course | Level | Date | Clip# | Line | Interlocutor | Content |
|---|---|---|---|---|---|---|
| Oral Assessments | Graduate | 2019-08-15 | 3 | 121 | S01 | so ∆why we talk about binary search∆↗ |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 122 | S01 | because (0.3) if we want to ☉sort☉ from a |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 123 | S01 | binary tree→ (0.7) so we have to talk about |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 124 | S01 | xxx research |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 125 | UNK | (0.4) |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 126 | T02 | ⌈eh what do you mean by sort↗ |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 127 | S01 | ⌊☉for this☉ |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 128 | UNK | (0.5) |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 129 | S01 | uh sort means that you have to arrange the |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 130 | S01 | ⁇trees⁇ uh in a (0.5) way that (.) ⁎like⁎ |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 131 | S01 | from xxx that i- is follow one format↘ for |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 132 | S01 | example ⁇the lower⁇→ tree and uh th- ⁇this⁇ |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 133 | S01 | got uh much bigger from the top to the |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 134 | S01 | bottom→ |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 135 | S01 | or is g- going uh smaller from the bottom |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 136 | S01 | to the top↘ |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 137 | UNK | (0.5) |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 138 | T02 | ⌈mhm |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 139 | S01 | ⌊so that is a kind of sort↘ so while we |
| Oral Assessments | Graduate | 2019-08-15 | 3 | 140 | S01 | are doing the binary tree→ we we (.) we we |