Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

problem selekcji · Vinony

🌐Polski

English Bahasa Indonesia Deutsch Español Français Polski Português Türkçe Русский العربية فارسی 한국어 中文日本語

EntityQ3252726· pop 17· linked from 106 articles

problem selekcji

algorithm for finding kth smallest number in a list or array

Available in 17 languages

Español
Français
Deutsch
中文
日本語
Русский
العربية
Bahasa Indonesia
Catalan
Hungarian

Connections

maxima and minima

computer science

Categories

Selection algorithms

Sources

wikipedia.externallinksexternallink

What links here106 pages

Yao's principle

C++ Standard Library

comparison sort

Batcher odd–even mergesort

computerized adaptive testing

median of medians

Kenneth Edward Batcher

sorting algorithm

odd–even sort

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

subset sum problem

Entitydist 0.47

exponential search

Entitydist 0.54

Baum–Welch algorithm

Entitydist 0.55

Entitydist 0.55

Greedy algorithm for Egyptian fractions

Entitydist 0.58

index calculus algorithm

Entitydist 0.59

British Museum algorithm

Entitydist 0.60

phonetic algorithm

Entitydist 0.60

baby-step giant-step

Entitydist 0.61

binary decision diagram

Entitydist 0.66

Entitydist 0.66

Category:Computer arithmetic algorithms

Entitydist 0.67

via Wikidata sitelinks · CC0

arithmetic

Entity

International Standard Book Number

digital object identifier

array data structure

Sign in to save