- cross-posted to:
- [email protected]
You must log in or # to comment.
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.
And if you’re working from a secure compartmentalized environment or are working on a high security project that doesn’t let you pull libraries from outside. Lots of reasons for being able to roll your own. Besides the fact that it takes like two minutes to write it correctly.
Which languages would that be? I imagine it is used in most cases.
Assembly, LLVM IR, etc
Ah yes
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 aren’t.
To quick sort out the bad jobs.
