- cross-posted to:
- programmer_humor@programming.dev
You must log in or # to comment.
I mean, they teach sorting algorithms because they illustrate all the basic ideas of complexity theory while being immediately understandable in a way linear programming or primality testing or something aren’t.
And if you’re in a language that doesn’t implement it
You might need a custom one as well. Modify the algorithm.
Good to demonstrate the divide and conquer approach.
Which languages would that be? I imagine it is used in most cases.
Assembly, LLVM IR, etc
Ah yes
To quick sort out the bad jobs.
