Re: optimizing compiler against average assembly programmer.

Graham C. Hughes <graham.hughes@resnet.ucsb.edu> wrote:
[snip]
: Put another way, there's no way your immensely optimized bubble sort
: is going to beat out my simple merge sort for reasonable data sizes.
[snip]


[A lot of swearing deleted...]


[rhetorical question] What makes you think that an assembly language
programmer would write a bubble sort in the first place?


It seems to be the trend among HLL advocates that an assembly language
programmer has to use the slowest algorithms know to mankind. This is
simply not true. Only an IDIOT would use bubble sort for general
sorting. Only an even bigger IDIOT would think that some other
programmer would use bubble sort for general sorting.


Just my self-censored opinnion.
--
==> Vesa Karvonen
[Well, not a bubble sort but maybe an insertion sort. I have
certainly observed that assembler programmers tend to avoid complex
algorithms because they're hard to express and debug in such a
low-level language. I wrote a small sort/merge program in assembler
for the HP2100 some years ago, and didn't do all sorts of stuff that
I'd have done in a better language, just because I didn't have time to
debug it one instruction at a time. I did use heapsort. -John]


--

Return to the comp.compilers page.
Search the comp.compilers archives again.