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)