The compound sort example resides in the L1/benchmarks/compound_sort directory.
This benchmark tests the performance of the compoundSort primitive with an array of integer keys. This primitive is named as compound sort, as it combines insertSort and mergeSort, to balance storage and compute resource usage.
The tutorial provides a step-by-step guide that covers commands for building and running the kernel.