APL vs Zig

No complicated loop processing to apply a function to a array of arrays. Functions are defined in a way that they will typically operate the same way on any number of array dimensions. This, along with the clear syntax, leads to very compact code that can be comprehended in a single line, rather than spread out over many pages.

There is no operator precedence to memorize, as everything is evaluated right-to-left. E.g., in APL 3*10+3 = 39. You do have to type in some otherwise unusual characters, such as ↓ and ∊, but those are easy enough to pick up -- and they have the advantage of being easily remembered once understood, as they often have some connection to common mathematical symbols.

You can seriously implement Conway's Game of Life in one line. There's a reason we do algebra with symbols instead of story problems. APL is good as a language of thought, since you can hold entire algorithms in your head at once.

It's safer than C, at least.

Zig is pretty fast, in some cases even faster than C.

Zig programs can import C libraries and export header files to be used in C programs.

No operator overloading, property methods, runtime dispatch, macros, etc.

Zig can execute code at compile-time, allowing for more performant and readable programs.

The Zig compiler can build artifacts for any Tier 3 Supported platform without additional downloads.

Produces binary smaller than C.