← All labs
Book lab 18
Competitive Programming and ML Thinking
Algorithmic discipline inside ML systems
Reader access
Open this chapter lab
Labs are for students with an account. Sign in or create your account to open them.
Chapter assignment
Translate an ML retrieval or ranking task into an algorithmic problem. Compare brute-force search with indexed search by latency and recall.
What to do now
- Define input size and complexity.
- Choose the approximation trade-off.
- Explain when exact search is still acceptable.
Submit your answer
Write a short answer or working notes for this chapter. It is saved for review.
Next in Adaptly
Use the code lab to practise a small implementation step.
