On Thu, 04 Apr 2013 12:25:18 +0200, Rosario1903
If I'm understanding you, no, almost nobody thinks that. Assembler
requires a great deal of bookkeeping work to be done manually, leaving
the details of the algorithm obscured in a sea of implementation
details. Certain simple algorithms, when implemented on a machine
with sufficient, and easy to use, resources, are only moderately more
complex in assembler than in an HLL. Basic quicksort, for example,
where the partitioning operation is a minimal amount of address
adjustment and comparison. OTOH, that's invariably a bad
implementation of quicksort, and doing quicksort properly (at a
minimum, eliminating tail recursion, shortest partition first,
median-of-three - and that's still not really adequate, IMO), you end
up with a great deal more complexity.
And obviously assembler may make something easier than a HLL. For
example, detecting overflow, or doing integer multiplication with
double width results, may be easier in assembler because those
facilities are not well exposed in the HLL, but those are rather less
common cases.
And the examples in a book like K&R2 are not really good examples of
the effect you're describing - those example are generally chosen to
be simple, and to illustrate points of the language. Heck, most of
the K&R2 samples don't even involve subroutine calls.
But in all these things the biggest factor is familiarity. A program
in any language will be hard to understand if you're not well versed
in that language.