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:

Desafío de Algoritmos: Willi Flow

Froggy Jumps

Played 8

About this activity

Motívate al final: willi flow

Created by

Colombia

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
Desafío de Algoritmos: Willi Flow
 

Froggy Jumps

Desafío de Algoritmos: Willi FlowOnline version

Motívate al final: willi flow

by Willian Solis
1

¿Qué algoritmo de ordenamiento divide el arreglo por un pivote y recurre a particiones para ordenar?

2

¿Qué técnica de búsqueda funciona en arreglos ordenados en O(log n)?

3

¿Qué algoritmo encuentra el camino más corto desde un nodo hacia todos los demás en grafos con pesos no negativos?

4

¿Qué algoritmo de ordenamiento estable usa el enfoque dividir y mezclar fases?

5

¿Qué algoritmo produce un árbol de expansión mínimo en grafos no dirigidos pesados primero por peso?

6

¿Qué técnica resuelve subproblemas solapados guardando soluciones para evitar recomputaciones?

7

¿Qué estructura de datos ofrece búsqueda, inserción y borrado promedio en O(1)?

8

¿Qué algoritmo de grafos determina la ruta más corta entre todos los pares de nodos?

9

¿Qué estructura de datos mantiene pares clave-valor y permite búsquedas rápidas con hashing?

10

¿Qué técnica de búsqueda de rutas utiliza una heurística para estimar la distancia al objetivo?

Are you sure you want to leave the page?

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