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

Greedy Algorithm Essentials (Bahasa Indonesia)

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
Greedy Algorithm Essentials (Bahasa Indonesia)
 

Crossword Puzzle

Greedy Algorithm Essentials (Bahasa Indonesia)Online version

Kata kunci greedy untuk teka-teki silang

by Dea Maha Rani Tarigan
1

masalah memilih barang berukuran berat agar kapasitas tas tidak terlampaui sambil memaksimalkan nilai.

2

algoritma membangun pohon spanning minimum dengan menambahkan tepi berbiaya rendah secara berurutan tanpa membentuk siklus.

3

algoritma menemukan pohon spanning minimum dengan menambahkan verteks terhubung biaya terendah setiap langkah.

4

teknik kompresi data menggunakan pohon kode prefiks untuk mengoptimalkan panjang kode.

5

penyusunan urutan pekerjaan untuk meningkatkan efisiensi atau memenuhi batas waktu.

6

mencari himpunan bagian dengan ukuran minimum yang menutupi semua elemen yang ada.

7

masalah membuat jumlah tertentu menggunakan mata uang berbeda dengan jumlah bagian minimum.

8

tugas yang perlu dijadwalkan atau diselesaikan dalam sebuah proyek untuk mengoptimalkan sumber daya.

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

If you leave, you will lose the game in progress.