<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Top-K on wid's blog</title><link>https://wid-blog.github.io/en/tags/top-k/</link><description>Recent content in Top-K on wid's blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Thu, 09 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://wid-blog.github.io/en/tags/top-k/index.xml" rel="self" type="application/rss+xml"/><item><title>Top-K — Heap Is Not Always the Answer</title><link>https://wid-blog.github.io/en/posts/tech/algorithm/top-k-heap-vs-quickselect/</link><pubDate>Thu, 09 Jul 2026 00:00:00 +0000</pubDate><guid>https://wid-blog.github.io/en/posts/tech/algorithm/top-k-heap-vs-quickselect/</guid><description>A heap is the reflex answer to K-th largest problems, but when the whole array is already in memory, Quick Select is faster on average. The size-K heap and Quick Select mechanics, and how the shape of the data decides between them.</description></item></channel></rss>