Learning path
Writing efficient code
Pick the data structure and the algorithm that hold as the data grows, and prove it by analysis, then by measurement.
5 steps · 17 decks
The steps, in order
Each step opens once the one before is well under way. Tap a deck to see its topics and a few cards.
- Step 1
Complexity
- Step 2
Data structures
- Step 3
Efficient sorts
- Step 4
Performance
- Step 5
Going further
- The badge to earn
Sharp code
It is yours once every step is mastered.
Explorer
The structure workshop
Lists, trees, heaps and sorts step by step
The path leads to this Explorer, where you get your hands on what its decks have you study.
Open the ExplorerPart of these courses
- Computer science B.U.T., second year, Application development track
- Computer science B.U.T., second year, Deploying connected and secure applications track
- Computer science B.U.T., second year, Data administration, management and use track
- Computer science B.U.T., second year, Application integration and information system management track
The first step fits in one session.
Free: the whole library, unlimited reviews, no ads. See pricing