Today I want to talk about the paradigms of programming, how they affect our success as designers of computer programs, how they should be taught, and how they should be…
Robert W. Floyd
Author Archives
Algorithm 489: the algorithm SELECT—for finding the ith smallest of n elements [M1]
SELECT will rearrange the values of array segment X[L: R] so that X[K] (for some given K; L ≤ K ≤ R) will contain the (K-L+1)-th smallest value, L ≤ I ≤ K…
Expected time bounds for selection
A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select…
Bounded context syntactic analysis
Certain phase structure grammars define languages in which the phrasehood and structure of a substring of a sentence may be determined by consideration of only a bounded…
On the nonexistence of a phrase structure grammar for ALGOL 60
ALGOL 60 is defined partly by formal mechanisms of phrase structure grammar, partly by informally stated restrictions. It is shown that no formal mechanisms of the type…
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved