A card from a free library — ask anything, no account, works offline. Every card carries its source.
Algorithms — good beats bad
computer science
The same task costs wildly different work: merge sort takes ~n log n (24 comparisons for 8 items, sealed), the naive way n^2 (64). As n grows the gap explodes - algorithms, not just faster hardware, are the heart of the field. Rests on P vs NP.
source
Narrow Highway — computer science
card id
card_cs_algorithms
address
WIT.codex.FCT/algorithms-good-beats-bad/REF.WITNESSED@narrow-highway
adjoining cards
- part of → Computer science — bits, logic, and what can be computed — a pillar of computer science (Algorithms)
- connects at → The P versus NP chain - from the machine and the circuit to the three barriers — algorithmic cost and complexity classes - the P vs NP region
Is this card incomplete? Tell the library — it will call out for more ↗