Reentrancey (title must be 15 characters)

[ABG]

Here's another example ...

Merge Sort Block Procedures Library

This is a set of procedures you can use to sort lists and tables, using your own test criterion for greater/lesser comparison. It is based on the merge sort algorithm, which runs at n*log(n) speed. The procedure blocks should be draggable directly into your Blocks Editor workspace. [blocks] [merge] merge_sort.aia (4.9 KB) [merge_sort] [merge_sort_sample_call] [output] [precedes] [randoms] [segment] The logic: function merge_sort(list m) // Base case. A list of zero or one elements is sort…