Jump to content

Talk:K-sorted sequence

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Supyovalk (talk | contribs) at 19:00, 6 May 2025 (Assessment: banner shell, Computer science (Rater)). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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)[reply]

> 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)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:K-sorted_sequence&oldid=1289143229"