4 ms·
In what sense are sorting algorithms more fundamental than say font rendering algorithms? Nowadays, they are both supplied in standard libraries and few progr
by amichail 16y ago
In what sense are sorting algorithms more fundamental than say font rendering algorithms? Nowadays, they are both supplied in standard libraries and few programmers would implement either.
- olalonde 16y agoThey are used in many more situations. A lot of problems can be reduced[1] to or contain a sorting problem. The same cannot be said about font rendering algorithms. [1] http://en.wikipedia.org/wiki/Reduction_(complexity) http://en.wikipedia.org/wiki/Reduction_(complexity)
- amichail 16y agoRendering text is even more useful than sorting.
- olalonde 16y agoYou are right in the sense that there is no formal definition for what makes an algorithm fundamental (AFAIK - I am no expert on the matter). However, the general consensus seems to be that since a large number of problems make use of or can be reduced to a sorting problem, it is more fundamental than font rendering which solves exactly one problem. In fact, I wouldn't be surprised if font rendering algorithms use sorting in some way.