Quantum Bogosort is a sorting algorithm:
1. Shuffle list randomly.
2. If it's sorted, stop.
3. If it's not sorted, destroy the universe.
Given many-worlds interpretation of QM, 1+ universes will survive with a sorted list. This is O(n) assuming destroying the universe is O(1).
@PeterHilton I always thought it was because of different and unpredictable look across different platforms and the fact that the native controls were often downright appalling.
Agree. This is not a time for being modest. I donated via @UKRinCZE. If you are reading this tweet chances are you are a well-paid software engineer and you can afford to donate too!
For my Czech followers: @HlidacStatu maintains this How-To-Help sheet: https://t.co/0AfVsg2zA6
When designing an #API, request methods matter because they have interaction semantics: they can be safe, they can be idempotent, or none of these. For an interesting design approach, learn "Why @mamund Stopped Using POST and Learned to Love #HTTP". https://t.co/RE0nnzKNxi
github copilot has, by their own admission, been trained on mountains of gpl code, so i'm unclear on how it's not a form of laundering open source code into commercial works. the handwave of "it usually doesn't reproduce exact chunks" is not very satisfying
We are #hiring a Senior Backend Engineer 🛠 (f/d/m) with experience in scaling #NodeJS web services and more
Fully #remote (CET ±2h), great team working on a great product
RT and feedback on the job ad is very much appreciated 🙏
#RemoteTechJobs
https://t.co/bO2rUQ5xIw