Reducing computational complexity with array predicates
Published • Jul 27, 1998
NobleIDNI5P14W70R60S87
Authors:
Robert Bernecky
Abstract
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. The search primitives, indexof and set membership, and the sorting primitives, upgrade and downgrade, execute in linear ti...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!