Fig 1.
Wall-3 Sort example (first page).
Fig 2.
Wall-3 Sort example (second page).
Table 1.
Data size condition and time complexity for different values of L.
Fig 3.
Wall-L complexity analysis: (Left) Exponent of n decreases as L increases; (Right) Actual growth rates show how higher L values approach behavior.
Table 2.
Wall-1 block sizes for different input sizes and layer depths L.
Table 3.
Stack depth comparison: Classical log2n Algorithms vs. k-way Merge Sort and Wall-L.
Fig 4.
The grouped bar chart illustrates how the execution time scales with input size (N) for each algorithm in a high computing environment.
Table 4.
Experimental results of approximate execution times in seconds of different sorting algorithms under a high computing environment.
Table 5.
Experimental results show execution time and survivability of recursive sorting algorithms under artificial stack-depth limiting environments ().
The sign × indicates a recursion error, and ✓ indicates successful execution.
Table 6.
Feature-wise comparison of Wall-L sorting with classical sorting algorithms.