Algorithms
T
Building and Comparing Algorithms
Push a bit harder. Apply what you know to less familiar problems.
Computer Science · Medium
5
questions · ~4 min · 3 hints each (−5 pts)
Confidence tracking, 3-tier hints and instant feedback.
What you'll learn
Each question helps you build key knowledge and skills.
- 1Algorithms can be represented using flowcharts, pseudocode or written descriptions, and each should produce the same logical steps.
- 2Linear search has a worst case of checking every item, while binary search repeatedly halves the search space, making it much faster on large sorted lists.
- 3Bubble sort repeatedly steps through a list, comparing adjacent items and swapping them if they are in the wrong order, until no swaps are needed.
- 4Insertion sort builds a sorted section of the list one item at a time by inserting each new item into its correct position, while merge sort splits the list and merges sorted halves back together.
- 5Trace tables help you follow pseudocode line by line, recording how each variable's value changes, which is useful for checking an algorithm works correctly.
Question mix
A mix of question types to build your skills.
- Multiple choice×5
Different question types help you think in different ways.
How it works
A simple 3-step process
- 1
Rate your confidence
Tell us how sure you feel before answering. It helps us understand your starting point.
- 2
Use hints if stuck
Get up to 3 helpful hints per question. Each hint costs 5 Treasure Points.
- 3
See what went wrong
Get instant feedback with clear explanations, so you can learn and improve.
Ready when you are
This takes about 4 minutes.