Array algorithms

Authors:
John E. Howland
Affiliations:
Trinity University, San Antonio, Texas
Venue:
Journal of Computing Sciences in Colleges
Year:
2005

Citing 7
Cited 0

APL thinking: examples

APL '87 Proceedings of the international conference on APL: APL in transition
A one-way array algorithm for matroid scheduling

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A survey “APL thinking”

ACM SIGAPL APL Quote Quad
An array-based algorithm for simultaneous multidimensional aggregates

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Reentrant polygon clipping

Communications of the ACM
Real-world problem-solving, pedagogy, and efficient programming algorithms in computer education

ACM SIGCSE Bulletin
APL thinking finding array-oriented solutions

APL '81 Proceedings of the international conference on APL

Quantified Score

Hi-index	0.00

Visualization

Abstract

Array Algorithms are defined as functional algorithms where each step of the algorithm results in a function being applied to an array, producing an array result. Array algorithms are compared with non-array algorithms. A brief rationale for teaching array algorithms is given together with an example which shows that array algorithms sometimes lead to surprising results.