New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Inside Algorithms Quiz

Quiz

Played 0

About this activity

Quick checks on core algorithms concepts.

Created by

United States

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Inside Algorithms Quiz
 

Inside Algorithms QuizOnline version

Quick checks on core algorithms concepts.

by Shilo Duran
1

What is the time complexity of binary search on a sorted list?

2

Which data structure is optimal for implementing a priority queue?

3

Dijkstra's algorithm is used to find:

4

Dynamic programming is best when problems have:

5

Which sort has average time complexity O(n log n) and is in-place?

6

What is a graph with no cycles called?

7

In Big-O notation, which term dominates for large n?

8

Breadth-first search explores a graph in:

9

Which problem is commonly solved with a greedy algorithm?

10

Which data structure supports push and pop in O(1) amortized?

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.