https://yosgi.github.io/en/tags/array/Recent content in Array on YosgiHugoenMon, 29 Jun 2026 09:20:51 +0000https://yosgi.github.io/en/post/215-kth-largest-element-in-an-array/Thu, 25 Feb 2021 00:00:00 +1300https://yosgi.github.io/en/post/215-kth-largest-element-in-an-array/30min The first thing that comes to mind when I get the question is to sort it directly… But we can optimize the quick sort to get the result Solution 1. Quick sort The idea of quick sort is to find a benchmark in the array and divide the array into the benchmark, the part smaller than the benchmark, and the part larger than the benchmark. The benchmark itself has been sorted. If the benchmark is the kth largest element, the result can be obtained directly.https://yosgi.github.io/en/post/arrays-stacks-queues/Wed, 22 Aug 2018 15:09:45 +1200https://yosgi.github.io/en/post/arrays-stacks-queues/Javascript Data Structures