As I'm wading through "Mastering algorithms with Perl" and interesting idea was born in my mind. It's been long since I first noticed it - implementation of algorithms is inherently procedural.
Think of a known algorithms book like Cormen et. al. ("Introduction to algorithms"). The pseudo code in it is procedural. Now, it's understandable that all the books with C implementations are procedural.
When we get to Perl we might expect to see other styles - but... we also see procedural (structural, or however you want to call it) code. No OO (OO has little meaning in algorithms, only in interfaces of data structures), no functional.
Even Lisp code of algorithms is usually procedural. See the common implementations of A*, for example.
So, I wonder... algorithm is "description of an operation step-by-step to solve some problem". Does this definition render it naturally to structural code ?
In reply to coding of algorithms is inherently procedural by spurperl
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |