4 ms·
>... but taken literally it suggests assinine ideas like using bubble sort instead of merge sort for a large set not because of any memory footprint constraints
by throwaway55554 7y ago
>... but taken literally it suggests assinine ideas like using bubble sort instead of merge sort for a large set not because of any memory footprint constraints but because it is easier to read.
No, it doesn't suggest this at all. It means use the merge sort but implement it in a clean, understandable way.
- jodrellblank 7y agoIt means use the merge sort but implement it in a clean, understandable way. https://rosettacode.org/wiki/Sorting_algorithms/Merge_sort https://rosettacode.org/wiki/Sorting_algorithms/Merge_sort - which ones of these do you consider objectively "clean and understandable"? Why should any of them (Prolog, Mercury, J, Common-Lisp, etc) be considered "not understandable" instead of "not familiar to the reader"?