📻
Coding
That's been proven to be O(N^2) and we need a solution that's O(NlogN).
- San Francisco
- http://0x9900.com/
Highlights
- Pro
Lists (1)
Sort Name ascending (A-Z)
Stars
A screamingly fast Python 2/3 WSGI server written in C.
Create an interactive map of contacts from an ADIF log file
Configs for using svxlink to connect an EchoLink station by RF to an existing repeater, calmly, without extra noise.
Wikipedia tools (for Humans): easily extract data from Wikipedia, Wikidata, and other MediaWikis