×
Copy
Open
Link
Embed
Share
Beginning
This slide
Copy link URL
Copy link URL
Copy iframe embed code
Copy iframe embed code
Copy javascript embed code
Copy javascript embed code
Share
Tweet
Share
Tweet
Slide 1
Slide 1 text
No content
Slide 2
Slide 2 text
No content
Slide 3
Slide 3 text
No content
Slide 4
Slide 4 text
No content
Slide 5
Slide 5 text
Semana 0
Slide 6
Slide 6 text
decimal 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
Slide 7
Slide 7 text
binario 0, 1
Slide 8
Slide 8 text
No content
Slide 9
Slide 9 text
50
Slide 10
Slide 10 text
No content
Slide 11
Slide 11 text
42
Slide 12
Slide 12 text
No content
Slide 13
Slide 13 text
hexadecimal 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, a, b, c, d, e, f
Slide 14
Slide 14 text
No content
Slide 15
Slide 15 text
entrada → → salida
Slide 16
Slide 16 text
algoritmos
Slide 17
Slide 17 text
tamaño del problema tiempo para resolver
Slide 18
Slide 18 text
tamaño del problema tiempo para resolver n
Slide 19
Slide 19 text
tamaño del problema tiempo para resolver n n/2
Slide 20
Slide 20 text
tamaño del problema tiempo para resolver n n/2 log n
Slide 21
Slide 21 text
wikipedia.org
Slide 22
Slide 22 text
Semana 3
Slide 23
Slide 23 text
No content
Slide 24
Slide 24 text
https://cs.calvin.edu/activities/books/c++/ds/1e/ binary search tree
Slide 25
Slide 25 text
4 2 6 8 1 3 7 5
Slide 26
Slide 26 text
No content