For the complete documentation index, see llms.txt. Markdown versions of all pages are available by appending .md to any URL (e.g. /max/get-started.md).

Mojo package

algorithm

High performance data operations: vectorization, parallelization, reduction, memory.

PRECOMMIT: Update wording to mention std.algorithm has non-accelerator algorithms.

The algorithm package provides high-performance primitives for data-parallel operations. It includes tools for vectorization (SIMD operations on contiguous data), parallelization (distributing work across multiple cores), and reduction operations (aggregating values). These building blocks enable efficient computational kernels without manual SIMD intrinsics or thread management.

Use this package for large datasets, numerical algorithms, or compute-intensive code. For element-wise operations on small data, standard loops may be simpler.

Packages

• ​backend:

Modules

• ​functional: Implements higher-order functions.
• ​memory: Implements unsafe_parallel_memcpy.
• ​reduction: Implements SIMD reductions.

Was this page helpful?

Thank you! We'll create more content like this.

Thank you for helping us improve!

😔 What went wrong?

Some code doesn’t work

It includes inaccurate information

It's missing information I need

It was difficult to understand

Other

Submit