# The Michigan Algorithm Decoder

UM Libraries, 1965 - Algorithms - 151 pages

### What people are saying -Write a review

We haven't found any reviews in the usual places.

### Contents

 Section 1 2 Section 2 3 Section 3 6
 Section 4 52 Section 5 85 Section 6 89

### Popular passages

Page 1 - The White Rabbit put on his spectacles. "Where shall I begin, please, your Majesty?" he asked. "Begin at the beginning," the King said gravely, "and go on till you come to the end; then stop.
Page 98 - That is not said right,' said the Caterpillar. 'Not QUITE right, I'm afraid,' said Alice, timidly; 'some of the words have got altered.' 'It is wrong from beginning to end,' said the Caterpillar decidedly, and there was silence for some minutes.
Page 10 - The decimal point Is assumed to be Immediately to the right of the rightmost digit, but is always omitted. Integers may be positive or negative, and while the "+" sign may be omitted, the "-" sign must be present if the number is negative (eg, 2, -2, 0, +0, -0, -100 are all integers). Leading (but not following) zeros may be omitted (eg, 5 and 005 represent the same integer, but 3 and 300 do not ) . 1.1.2 Floating Point Constants Floating point constants may be written with or without exponents.
Page 10 - There is a pleasure, sure, In being mad, which none but madmen know...
Page 11 - A statement label consists of from one to six letters or digits, the first of which must be a letter, eg, IN or BACK.
Page 1 - ... ambiguity. It will further be seen that the procedure 'may be given in written prose form or in a graphical form called a flow chart. Example 2: Consider the problem of determining the largest number In a collection of n numbers A = -f a0, alf..
Page 20 - THROUGH statement causes the block of statements which follows immediately afterwards to be repeatedly executed, each time varying the value of some variable, until the specified list of values for that variable is exhausted, or until some specified condition is satisfied. The THROUGH statement may take either of the following two forms.
Page 44 - ... from left to right) to a special section of storage which is separate, from the usual storage of variables and arrays. Each ERASABLE declaration eliminates the effect of previous assignments to this special section of storage, thus allowing several arrays to occupy the same storage at different times. It should be understood that this storage is accessible to, and may be used by, subroutines.
Page 30 - I Integer F Fixed point number (internally floating point) E Floating point number K Octal number C Characters T (Causes a transfer of the format scanner) (For the purposes of input-output the Boolean values OB, IB are considered as integers and will be punched in cards and appear in print as 0,1.) The integer indicates the size of the field; ie, the number of available columns to be used. For example, K3 indicates a 3-column octal field, C23 indicates a 23-column character field, and S31 indicates...
Page 38 - Remark Declaration A remark declaration consists of any string of characters acceptable to the computer. This statement is completely ignored by the translator, and furnishes information to...