Talk:K-sorted sequence

I found the DOI on https://dl.acm.org/doi/10.5555/70413.70419#sec-terms and don't understand why it do not work Arthur MILCHIOR (talk) 21:48, 27 April 2021 (UTC)

> This algorithm is Par-optimal, that is, there exists no sequential algorithm with a better worst-case complexity.

What is "Par-optimal"? The "Par" appears as a broken link. — Preceding unsigned comment added by Mad with power (talk • contribs) 02:09, 14 December 2024 (UTC)

Equivalent definition is poorly phrased

It is written:

A sequence $[a_{1},\dots ,a_{n}]$ is $k$-sorted if and only if each range of length $2k+2$, $[a_{i},a_{i+1},\dots ,a_{i+2k+2}]$ is $k$-sorted.

...however, that is not enough to define $k$-sorted.

(Additionally, the range is actually of length $2k+3$.) Mateen Ulhaq (talk) 06:44, 20 January 2026 (UTC)