Skip to main content
Home
CEAPP

  • Home
  • Browse
  • Browse (ClassBank)
  • Actions and Practices
  • Search
  • Tutorials
  • Research
  • People
  • CRELLT

Breadcrumb

  1. Home
  2. Transcript Table

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 170241 - 170260.

Pagination

  • First page
  • Previous page
  • …
  • Page 8509
  • Page 8510
  • Page 8511
  • Page 8512
  • Page 8513
  • Page 8514
  • Page 8515
  • Page 8516
  • Page 8517
  • …
  • Next page
  • Last page
Course Level Date Clip# Line Interlocutor Content
- - - 1 115 S01 +≈ ok↘ so→ (0.3) ⁇better⁇ trees don't use any
- - - 1 116 S01 (0.5) using ⁇codes⁇ with binaries xxx
- - - 1 117 S01 binary search↘
- - - 1 118 UNK (1.7)
- - - 1 119 S01 ⁎um⁎
- - - 1 120 UNK (4.3)
- - - 1 121 S01 so ∆why we talk about binary search∆↗
- - - 1 122 S01 because (0.3) if we want to ☉sort☉ from a
- - - 1 123 S01 binary tree→ (0.7) so we have to talk about
- - - 1 124 S01 xxx research
- - - 1 125 UNK (0.4)
- - - 1 126 T02 ⌈eh what do you mean by sort↗
- - - 1 127 S01 ⌊☉for this☉
- - - 1 128 UNK (0.5)
- - - 1 129 S01 uh sort means that you have to arrange the
- - - 1 130 S01 ⁇trees⁇ uh in a (0.5) way that (.) ⁎like⁎
- - - 1 131 S01 from xxx that i- is follow one format↘ for
- - - 1 132 S01 example ⁇the lower⁇→ tree and uh th- ⁇this⁇
- - - 1 133 S01 got uh much bigger from the top to the
- - - 1 134 S01 bottom→
  • Reset your password
Powered by Drupal