
Idea, Algorithm, Technique  it is also
original Czech Lace from Vamberk

The structure of the Album is twodimensional and permits various paths through the material. Contents shows parts including algorithms having the same orientation, usually they tackle the same problem. There is one special part  techniques, too. It includes general useful methods of accomplishing a desired aim as removal recursion, construction of test data sets, creating of universal routines etc. (Recipe) Index is a list of algorithms sorted in alphabetical order. Descriptions of algorithms contain further reference in the section 'connections'. The Album is completed by the reflections on programming, see the chapter Reflexio 
Rexx code tends to run slowly. The key to a fast scripts are the efficient algorithms. I have been collecting such algorithms. It isn't a trivial job to translate algorithms from various pseudocodes or programming languages as Ada, ALGOL, BASIC, C, FORTRAN, Modula, Pascal, PL/1, into the useful code in the Rexx language.
The Album may be useful as a reference, since it contains an organized collection of algorithms. All of this are expressed in the Rexx language. You can try copy and paste this routines from browser into an editor, direct into a concrete program (in detail: Technique: Universal Unit). ATTENTION! Please, when you see the following fragment on the two lines, then you have to decrease font in your browser (Thanks Doug Rickman doug@hotrocks.msfc.nasa.gov from NASA for this warning).
After the downloading of my album you can change the properties of fonts by the arrangements of the AATSTYLE.CSS file.
The Album can be useful in a college course on algorithms as well in beginning courses of the programming in the Rexx language. The Album is an experiment: I use the Rexx language in an explanations and descriptions of algorithms, too. Hence I say things like "Its time complexity is FORMAT(3*N/22,,0) comparisons" or "pattern P. occurs with shift S in text T. if 0<=S<=NM and if T.SpJ=P.J, where SpJ indicates S+J, for J=1,...,M". The Album proves that the Rexx language is the suitable vehicle for presentation a set useful algorithms in clean, succint, and uniform code. Note  We therefore reserve the special symbol lgN to denote a logarithm with base 2.
if P = "" then P = 9; P = P + 4; numeric digits P See Reflexio.
download
There is the Album as ZIP file, Version 27th July 2009, 250kB. It is packed up by WinZip 8.0 (3105) of Nico Mak Computing, Inc.
Roderic A. Davis, New York
http://dav4is.8m.com/
Tobias Herp, Bad Homburg, Germany
Walter Pachl, Vienna, Austria
Doug Rickman, Global Hydrology and Climate Center, MSFC, NASA
Gerard Schildberger, Hankinson, North Dakota
James Barbetti
Michael Adams, Cologne, Germany
Walter Pachl, Vienna, Austria
George W. Perry, Flintstone, Georgia
George Perry's Home Page
Gerard Schildberger, Hankinson, North Dakota
Danny De Wilde, Belgium
Baudoin C., Meyer B. Méthodes de programmation Edition Eyrolles 61, Bd SaintGermain Paris 1978
Bentley J., Programming Pearls CACM, December 1986, Vol. 29, No. 12, p. 1161
Bentley J., Programming Pearls  A Sample of Brilliance CACM September 1987 No. 9, p. 754757
Bentley J., More Programming Pearls  Confession of a Coder AddisonWesley, 1990
Bird R. S., Notes on Recursion Elimination CACM, June 1977, vol. 20, No. 6, pp. 434439.
Brent R. P., Ramanujan and Euler's Constant Computer Sciences Laboratory, Australian
National University, August 1993
Cormen T. H., Leiserson Ch. E., Rivest R. L., Introduction to Algorithms The MIT Press, Cambridge, 1990
Durstenfeld R., Random Permutation CACM July 1964 No. 7, p. 420
Faddejev A.K., Sominskij J.S. Sbornik zadac po vyssej algebre Nauka, Moskva 1964
Feuer A.R., Gehani N. (ed.) Comparing and Assessing Programming Languages Ada, C and Pascal PrenticeHall, Inc. Englewood Cliffs, New Jersey 1984
Fiala E.R., Greene D.H., Data Compression with Finite Windows CACM, April 1989, Vol. 32, No. 4, pp. 490505
Floyd R. W., Rivest R. L., Algorithm 489 The Algorithm SELECT  for Finding the ith Smallest of n Elements [M1] CACM, March 1975, Vol. 18, No. 3, p. 173
Floyd R. W., Rivest R. L., Expected Time Bounds for Selection CACM, March 1975, Vol. 18, No. 3, pp. 165172
Gehani N., Ada  An Advanced Introduction PrenticeHall, Inc. Englewood Cliffs, New Jersey 1983
Jarnik V., Diferencialni pocet I  Nakladatelstvi Ceske Akademie Ved, Praha, 1963
Kahan W., Mathematics Written in Sand Version of 22 Nov. 1983.
http://www.cs.berkeley.edu/~wkahan/MathSand.pdf Knuth D. E., Fundamental Algorithms, vol. 1 of The Art of Computer Programming  2nd ed. AddisonWesley, 1973
Knuth D. E., Seminumerical Algorithms, vol. 2 of The Art of Computer Programming AddisonWesley, 1973
Knuth D. E., Sorting and Searching, vol. 3 of The Art of Computer Programming AddisonWesley, 1973
Kruse R. L., Data Structures and Program Design Prentice Hall International Editions, ISBN 0131960490
Lipski W., Kombinatoryka dla Programistow Wydawnictwa Naukowotechniczne, Warszawa, 1982
Martello S., Toth P., Knapsack Problems: Algorithms nad Computer Implementations Chichester, John Wiley & sons 1990
Olehla M., Tiser J., Prakticke pouziti FORTRANu Nakladatestvi dopravy a spoju Praha 1976
Park S. K., Miller K. W., Random Number Generators: Good ones are hard to find CACM October 1988 Vol. 31 No. 10, pp. 11921201
Press W.H., Teukolsky S.A., Vetterling W.T., Flannery B.P., Numerical Recipes in C : the art of scientific computing  2nd ed. University Press, Cambridge, 1992
Rich R. P., Internal Sorting Methods Illustrated with PL/1 Programs Prentice Hall, Inc., Engelwood Cliffs, 1972
Sedgewick R., Algorithms AddisonWesley, Reading, Massachusetts, 1984
Wirth N., Systematisches Programmieren  2nd ed. B.G Teubner, Stuttgart, 1975
Wirth N., Algorithms and data structure New Jersey, Prentice Hall, Inc., Engelwood Cliffs, 1986
Zabrodsky V., Variace na klasicke tema Elektronika, c. 6, 1992, 3334
Zabrodsky V., Problem dvou loupezniku BAJT, rijen 1993 (36), 134136

from 1st
January 2000, last modified 1st December 2003
Copyright © 20002003 Vladimir Zabrodsky
Czech Republic