Merge sort with O(sqrt(n)) auxiliary memory complexity – example run

It is an example run for array merge algorithm described here: https://max-arbuzov.blogspot.com/2021/10/merge-sort-with-osqrtn-auxiliary-memory.html. Using that algorithm will allow to create Mergesort-based algorithm with O(sqrt(n)) additional memory usage. 

Merge sort with O(sqrt(n)) auxiliary memory complexity (and even less)

In this text an algorithm is described that merges two sorted arrays into one sorted array. Time complexity is O(n), auxiliary memory complexity is O(sqrt(n)), and stable. If this algorithm is used for merge sort, then resulting sorting algorithm will be stable, have O(nlog(n)) time complexity and have O(sqrt(n)) auxiliary memory (and even less for some cases).