20 QUESTIONS · 5 TOPICS · ABOUT 12 MINUTES

A million items. Twenty steps.

The right algorithm turns impossible into instant. Twenty questions on sorting, searching, Big-O, graphs and design techniques, each explained, plus a sorting visualiser you can step through. No sign-up, nothing saved.

Start the quiz
STEPS TO FIND ONE ITEM IN 1,000,000
linear, O(n)1,000,000
sqrt, O(√n)1,000
binary, O(log n)20
QUESTION 1 / 20 · SORTINGEasy

Which sort repeatedly swaps neighbouring items that are in the wrong order?

SAME 8 NUMBERS, THREE WAYS

Watch the comparisons pile up

52817364
Start: 8 numbers in random order.
step 0 / 29
COMPARISONS0
MOVES0
Bubble sortWalk through the list swapping neighbours that are out of order; repeat until no swaps are needed.O(n²) comparisons · stable

What this algorithms test covers, in short

Twenty conceptual questions, four in each of five areas: sorting, searching, complexity (Big-O), graph algorithms, and design techniques such as divide and conquer, greedy methods and dynamic programming.

No code is required. The level is roughly a first algorithms course at university. The quiz is our own and not normed.

By What's Your IQ · Reviewed 4 Oct 2026
Format
20 multiple-choice questions, 4 options each
Topics
Sorting, searching, complexity, graphs, design
Level
First university course
Bonus
Step-through sorting visualiser
al-Khwārizmīgave algorithms their nameThe 9th-century Baghdad scholar's name, Latinised as "Algoritmi", became the word for a step-by-step procedure.1
c. 300 BCEuclid's algorithm. A method for the greatest common divisor, still in use, often called the oldest non-trivial algorithm.1
1959Shortest paths and quicksort. Edsger Dijkstra published his shortest-path algorithm; Tony Hoare invented quicksort the same year.2
1968The Art of Computer Programming. Donald Knuth's first volume made analysing algorithms a rigorous discipline.1
1998PageRank. A graph algorithm ranking web pages by their links became the basis of Google Search.3
  1. Knuth, D. E. (1997). The art of computer programming, Vol. 1: Fundamental algorithms (3rd ed.). Addison-Wesley.
  2. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269-271.
  3. Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30, 107-117.

Keep going

You can analyse an algorithm. How do you reason?

Our full IQ test measures logic and working memory across four domains: 60 questions, about 30 minutes.

Take the full IQ test