Deterministic Sorting Realization
When you realize that no deterministic comparison-based sorting algorithm can run faster than Ω(nlogn) time
A formally dressed man is being carried or held up in a crowded party while looking overwhelmed. The joke compares his apparent panic and helplessness to realizing the Ω(nlogn) lower bound for deterministic comparison-based sorting algorithms, a painful moment for computer science students and programmers. EN: A formally dressed man is being carried or held up in a crowded party while looking overwhelmed. The joke compares his apparent panic and helplessness to realizing the Ω(nlogn) lower bound for deterministic comparison-based sorting algorithms, a painful moment for computer science students and programmers.
man in purple suit / мужчина в фиолетовом костюмеcrowd / толпаwoman in black dress / женщина в чёрном платьеperson in turquoise shirt / человек в бирюзовой рубашкеbaseball cap / бейсболкаparty / вечеринкаhands supporting a person / руки, поддерживающие человекаsunglasses / солнечные очкиleopard-print clothing / одежда с леопардовым принтом
#алгоритмы#algorithms#сортировка#sorting#теория алгоритмов#algorithm theory#программист#programmer#информатика#computer science#детерминированный#deterministic#сравнение#comparison#сложность#complexity#ω(nlogn)#нижняя граница#lower bound#реакция#reaction#мем#meme#программистский юмор#programming humor#вечеринка#party
- @profunctor_io / 998 2018-06-29
- Type
- image
- Size
- 800×679 · 144.5 KiB
- Mood
- подавленный, абсурдный
- Language
- en
- Added