Algorithm: InsertionSort

This Typst code illustrates the Selection Sort algorithm (SelectionSortA)), which builds the sorted portion of an array incrementally by inserting each element into its correct position relative to the already sorted elements. The algorithm is written using a clean, custom syntax that defines simplified for and while constructs (new_for_loop and new_while_statement) without the begin and end blocks. The layout is rendered through the algorithmic package for structured algorithm formatting.