Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
64 results
Strengthen your skills in algorithmics and graph theory, and gain experience in programming in Python along the way. To follow ...
2,732 views
7 years ago
Representing variable length entities: Part 2 : Heap memory basics.
4,903 views
6 years ago
Video from http://www.cdf.toronto.edu/~heap/racket_lectures.html on how to flatten a nested list so that it includes only simple ...
4,209 views
12 years ago
video from http://www.cdf.toronto.edu/~heap/racket_lectures.html shows how to create a koch fractal without those annoying ...
1,805 views
http://www.cdf.toronto.edu/~heap/racket_lectures.html Video on how to build Sierpinski's triangle using recursion, since it is built ...
8,255 views
13 years ago
Video from http://www.cdf.toronto.edu/~heap/racket_lectures.html on the most natural way to write many functions --- recursion.
1,778 views
http://www.cdf.toronto.edu/~heap/racket_lectures.html Video on Serpinski's triangle, a fractal, most naturally rendered with ...
1,940 views
Representing variable length entities: Part 3 : Pitfalls of using heap memory.
3,913 views
Video from http://www.cdf.toronto.edu/~heap/racket_lectures.html on how to build Sierpinski's triangle using recursion, since it is ...
1,429 views
This series covers x86-64 NASM. Ever wondered how programs are laid out in memory? Dive into the world of Assembly with this ...
1,012 views
1 year ago
Video from http://www.cdf.toronto.edu/~heap/racket_lectures.html. Recursion is the obvious choice for implementing a function ...
902 views
Video from http://www.cdf.toronto.edu/~heap/racket_lectures.html on how to create the koch curve fractal using recursive ...
4,179 views
1,501 views
8 years ago
1,538 views
Discussed Heap sort and heapify method to create a max heap form array. Step by step instructions showing how to run heap sort ...
125 views
3 years ago
http://www.cdf.toronto.edu/~heap/racket_lectures.html Video on lists, a self-referential, or recursive, structure: they can contain lists ...
10,291 views
- So now that I've built out that structure, and I've got my all my elements from the previous video, just blown up a little bit. Let's say ...
580 views
Now you notice that in this situation, we're dealing with a zig zag structure and as a result, we use trinode restructure.
1,482 views
Video from http://www.cdf.toronto.edu/~heap/racket_lectures.html on how to use structs to create an aggregate with named parts.
2,848 views
4,604 views
