Content deleted Content added
No edit summary |
Array operations vs "structured programming" |
||
Line 83:
The primiive functions grade up, and grade down ((“) and (”) view with an APL font) -- they are not operators in APL terminology -- sort arrays of numeric values. If the array is multi-dimensional, a multi-way sort will be performed. The result is the set of indicies needed to reshape the array into a sorted form. Sorting of character data is also provided by these functions, but a left arguemt giving the collating sequence to be used must be supplied. A complex sequence (for example, upper and loewr case letters rating as identical unless needed to break ties) can be provided by using a multi-dimensional left argument. [[User:DESiegel|DES]] 17:50, 21 Feb 2005 (UTC)
== Array operations vs "structured programming" ==
I have a problem with the semantic inference in the article vis-à-vis
structured programming.
The article says, for example, "... but the array operations it [APL] included could simulate structured programming constructs."
In reality, it is structured program concepts, such as <i>Do For</i>, that are required (in other programming languages) to simulate the array operations natural to APL.
<p>
Array operations can reduce program size and complexity, often by an order of magnitude or more.
Smaller programs – less code – usually offer fewer opportunities for coding errors.
<p>
It's not that structured programming is an absolute '''good''' in and of itself, but is, rather, a '''gimmick''' required to bring some semblance of order to more primitive programming languages lacking sophisticated array capabilities.
[[User:Dav4is|-R.]] 21:46, 2005 May 23 (UTC)
| |||