We consider the problem of comparison-sorting an $n$-permutation $S$ that avoids some $k$-permutation $π$. Chalermsook, Goswami, Kozma, Mehlhorn, and Saranurak prove that when $S$ is sorted by inserting the elements into the GreedyFuture binary search tree, the running time is linear in the extremal function $\mathrm{Ex}(P_π\otimes \text{hat},n)$. This is the maximum number of 1s in an $n\times n$ 0-1 matrix avoiding $P_π\otimes \text{hat}$, where $P_π$ is the $k\times k$ permutation matrix of $π$, $\otimes$ the Kronecker product, and $\text{hat} = \left(\begin{array}{ccc}&\bullet&\\\bullet&&\bullet\end{array}\right)$. The same time bound can be achieved by sorting $S$ with Kozma and Saranurak's SmoothHeap. In this paper we give nearly tight upper and lower bounds on the density of $P_π\otimes\text{hat}$-free matrices in terms of the inverse-Ackermann function $α(n)$. \[ \mathrm{Ex}(P_π\otimes \text{hat},n) = \left\{\begin{array}{ll} Ω(n\cdot 2^{α(n)}), & \mbox{for most $π$,}\\ O(n\cdot 2^{O(k^2)+(1+o(1))α(n)}), & \mbox{for all $π$.} \end{array}\right. \] As a consequence, sorting $π$-free sequences can be performed in $O(n2^{(1+o(1))α(n)})$ time. For many corollaries of the dynamic optimality conjecture, the best analysis uses forbidden 0-1 matrix theory. Our analysis may be useful in analyzing other classes of access sequences on binary search trees.