Coding Temple Blog

Explore coding concepts through cultural stories

Temple of Huế

Temple of Huế

Loops

In the Temple of Huế, children learn about loops. A loop lets you repeat actions. For example, repeat(3) { moveForward(); } means move forward three times.

Temple of Tam Cốc

Temple of Tam Cốc

Boolean Logic

Boolean logic helps you make decisions using true or false values. If a condition is true, you perform an action. Otherwise, you skip it.

Temple of Bảo Lộc

Temple of Bảo Lộc

Sequences

A sequence is the order in which actions happen in your code. The order matters! Performing actions in the wrong order can lead to unexpected results.

Temple of Mỹ Sơn

Temple of Mỹ Sơn

Functions

Functions are reusable blocks of code that perform specific tasks. Parameters allow you to customize what a function does without rewriting it.

Temple of Thầy Phật

Temple of Thầy Phật

Variables

Variables are containers that store information you can use later in your program. Think of them as labeled boxes that hold values.

Temple of Trấn Quốc

Temple of Trấn Quốc

Arrays

Arrays are ordered lists of items. You can store multiple values in a single array and access them by their position.

Temple of One Pillar

Temple of One Pillar

Conditionals

Conditional statements allow your code to make decisions. Using if, else if, and else, you can execute different code based on different conditions.

St. Joseph's Cathedral

St. Joseph's Cathedral

Objects

Objects allow you to group related data and functions together. Each object can have properties and methods that define its behavior.

Temple of Immortals

Temple of Immortals

String Manipulation

String manipulation allows you to work with text data. You can combine strings, extract parts, and transform text to create meaningful messages.

Temple of the Citadel

Temple of the Citadel

Nested Loops

Nested loops are loops within loops. They're powerful for creating patterns and processing multi-dimensional data. Each inner loop completes before moving to the next outer loop iteration.

Temple of the Mekong

Temple of the Mekong

Recursion

Recursion is when a function calls itself to solve smaller versions of the same problem. It's elegant for problems that have repeating structures.

Perfume Pagoda

Perfume Pagoda

Data Sorting

Sorting algorithms arrange data in a specific order. Common methods include bubble sort, selection sort, and quick sort. Choosing the right algorithm improves performance.

Ready for More?

Choose a temple to start your coding adventure