Computing and tech
The structure workshop
Insert keys into a list, a tree or a heap, and watch each operation unfold. Race two sorts on the same array, sorted, reversed or shuffled, to see which one collapses.
Free, with your Voyelle account.
What leads here.
The decks that help you review what you handle here, and the learning path it belongs to.
The learning pathWriting efficient codeIts decks come in the right order, step by step, up to the badge.
The decks
- Big O notation
- Working out a complexity
- Dynamic array and linked list
- The hash table
- Sets as a data structure
- The binary search tree
- Balanced trees
- The heap and the priority queue
- Choosing a data structure
- Merge sort
- Quicksort
- Heapsort
- Profiling a program
- Optimising a program
- Eco-design in code
- Lambdas and closures
- What a flaw costs
In the same subject.
The test bench
Cost class, size and machine
The framework laid bare
Who is in charge: your code or the framework?
The image lab
Resolution, colours and kernels
Try it, then review what it taught you.
Free: the whole library, unlimited reviews, no ads. See pricing