Algorithm: MinSearch

This Typst code illustrates the Minimum Search algorithm (MinSearch(A)), which determines the index of the smallest element in an array. The algorithm is written using a clean, custom syntax that defines simplified for and if constructs (new_for_loop and new_if_statement) without the begin and end blocks. The layout is rendered through the algorithmic package for structured algorithm formatting.