New game
Download
SCORM download
To be used in an LMS (Moodle, Blackboard...)
Regular download
To be published on a website or blog.
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.
Get Academic Plan
If you wish, you can download a demo game here and test its integration:
Share game
Crossword Puzzle
Crossword Puzzle

Crucigrama de algoritmos útiles

Integrate it into your platform
G. Classroom M. Teams
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.

Get Academic 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.

Get Academic 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:

Get Academic Plan
%
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.

Get Academic Plan
Print your game
Crucigrama de algoritmos útiles
 

Crossword Puzzle

Crucigrama de algoritmos útilesOnline version

Conceptos clave de algoritmos de utilidad.

by Dulce Ximena Castañeda Bautista
1

Algoritmo que halla el camino mínimo desde un origen hacia otros nodos considerando costos no negativos.

2

Algoritmo de búsqueda de rutas que usa una heurística para estimar la distancia restante.

3

Ordena elementos dividiendo el conjunto y uniendo partes ya ordenadas.

4

Ordena mediante pasadas que van desplazando elementos a su posición correcta.

5

Ordena usando una estructura de montículo para colocar cada elemento en su lugar.

6

Obtiene un árbol que conecta todos los nodos con costos mínimos.

7

Construye un árbol que enlaza nodos con gasto incremental mínimo.

8

Recorrido en grafos por niveles expandiendo nodos vecinos desde un origen.

4
3
8
7
5
1
 
Are you sure you want to leave the page?

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