|
Icon |
Filename |
Bytes |
Date/Time |
Description |
![[Up]](/icon/updir_1.gif)
|
../
|
|
00-index.txt
|
4,382
|
1997/10/26 [08:14:58]
|
|
|
afai.def
|
161
|
1987/1/8 [18:37:10]
|
No description available
|
|
afai.mod
|
1,075
|
1987/1/8 [18:18:38]
|
No description available
|
|
|
allq.mzd
|
1,024
|
1987/4/26 [16:00:00]
|
Finds solutions of 8 queens problem
|
|
|
baltree.mod
|
7,714
|
1987/1/8 [18:18:46]
|
Insertion/deletoin in AVL-balanced tree
|
|
|
bench.mod
|
810
|
1987/1/8 [18:42:12]
|
Read text file
|
|
|
bingcd.mod
|
971
|
1987/1/8 [18:19:10]
|
Find greatest common divisor of two numbers
|
|
|
bitwise.mzd
|
1,024
|
1987/9/10 [16:00:00]
|
More bit stuff for Modula-2
|
|
|
btree.mod
|
6,968
|
1987/1/8 [18:19:24]
|
Insert/delete elements in a B-tree
|
|
|
case.lbr
|
27,648
|
1987/5/5 [16:00:00]
|
Modula-2 programming tool
|
|
|
cmpisqrt.mod
|
715
|
1987/1/8 [18:19:28]
|
Compute largest integer <= square root of int
|
|
|
cmppower.mod
|
745
|
1987/1/8 [18:19:34]
|
Raise integer to a positive power
|
|
|
complex.mod
|
647
|
1987/1/8 [18:19:40]
|
Multiply complex numbers
|
|
|
cross1.mod
|
3,385
|
1987/1/8 [18:19:46]
|
Generate a cross-reference table from a text
|
|
|
cross2.mod
|
15,267
|
1987/1/8 [18:19:56]
|
Generate cross-reference table using hash tbl
|
|
|
crunch.mod
|
658
|
1987/1/8 [18:20:04]
|
Eliminate multiple blank spaces in a file
|
|
|
dicetest.mzd
|
2,048
|
1987/4/26 [16:00:00]
|
Dice rolling test in Modula-2
|
|
|
divide.mod
|
975
|
1987/1/8 [18:20:08]
|
Divide an integer by a natural number
|
|
|
edit.mod
|
1,729
|
1987/1/8 [18:20:12]
|
Read a text
|
|
|
fibonacc.mod
|
797
|
1987/1/8 [18:20:16]
|
Compute Fibonacci numbers
|
|
|
fraction.mod
|
872
|
1987/1/8 [18:20:20]
|
Compute a table of exact fractions
|
|
|
gcdlcm.mod
|
889
|
1987/1/8 [18:20:26]
|
Compute GCD and LCM of two natural numbers
|
|
|
harmonic.mod
|
1,187
|
1987/1/8 [18:20:30]
|
Compute the harmonic function
|
|
|
knightst.mod
|
1,350
|
1987/1/8 [18:20:34]
|
Knight's Test problem
|
|
|
list.mod
|
1,392
|
1987/1/8 [18:20:42]
|
Locate records in an ordered list by a key
|
|
|
list2.mod
|
1,313
|
1987/1/8 [18:20:48]
|
Locate records in an ordered list by a key
|
|
|
m2vhoch.lbr
|
19,200
|
1987/4/26 [16:09:06]
|
Two prime computation programs
|
|
|
magicsqu.mod
|
810
|
1987/1/8 [18:20:54]
|
Count number of words in text by length
|
|
|
marriage.mod
|
2,548
|
1987/1/8 [18:20:58]
|
Find solution to stable marriage problem
|
|
|
mergesor.mod
|
3,538
|
1987/1/8 [18:21:06]
|
Natural merge sort w/ 3 files
|
|
|
mtmod2.lbr
|
8,192
|
1987/8/30 [16:00:00]
|
A selection of Modula-2 programs
|
|
|
optimalt.mod
|
7,529
|
1987/1/8 [18:21:14]
|
Find optimally structured binary search tree
|
|
|
palindro.mod
|
613
|
1987/1/8 [18:21:18]
|
Find integers whose squares are palindromes
|
|
|
permute.mod
|
734
|
1987/1/8 [18:21:20]
|
Compute all n! permuatations of integers
|
|
|
plo.mod
|
8,458
|
1987/1/8 [18:21:30]
|
Skeleton compiler w/ syntax checking
|
|
|
polysort.mod
|
4,922
|
1987/1/8 [18:21:36]
|
Polyphase sort program
|
|
|
postfix.mod
|
962
|
1987/1/8 [18:21:40]
|
Convert expressions from infix to postfix
|
|
|
power2.mod
|
1,127
|
1987/1/8 [18:21:44]
|
Compute table of positive and neg. powers of 2
|
|
|
pplot.mod
|
1,474
|
1987/1/8 [18:21:50]
|
Printer plot module
|
|
|
primes.mod
|
925
|
1987/1/8 [18:21:58]
|
Compute a table of first n prime numbers
|
|
|
printerp.mod
|
954
|
1987/1/8 [18:22:02]
|
Plot a function on the screen
|
|
|
procon.fzx
|
896
|
1987/4/26 [16:22:04]
|
Producer/Consumer Test Module
|
|
|
procon.mzd
|
1,024
|
1987/4/26 [16:22:30]
|
Producer/Consumer Test module
|
|
|
queens8.mod
|
1,139
|
1987/1/8 [18:22:08]
|
8 Queens problem
|
|
|
recurren.mod
|
2,041
|
1987/1/8 [18:22:16]
|
Determine recurrence relations
|
|
|
selectio.mod
|
1,994
|
1987/1/8 [18:22:20]
|
Find optimal selection of objs from a set
|
|
|
sequence.mod
|
1,064
|
1987/1/8 [18:22:24]
|
Find non-adjacent sequence of digits
|
|
|
shellif.mzd
|
1,920
|
1987/4/26 [17:29:30]
|
ZCPR3 MOD for IF/ELSE in a shell
|
|
|
sierpins.mod
|
1,116
|
1987/1/8 [18:22:28]
|
Sierpinski module
|
|
|
sieve.mod
|
736
|
1987/1/8 [18:22:32]
|
Table of primes using sieve of Erasthenes
|
|
|
sort.mod
|
3,682
|
1987/1/8 [18:22:38]
|
Performs various types of sorts on an array
|
|
|
strlib.def
|
4,154
|
1987/1/8 [18:37:16]
|
String manipulation for MRI Modula2
|
|
|
strlib.mod
|
15,523
|
1987/1/8 [18:22:48]
|
String manipulation for MRI Modula2
|
|
|
strtes.mod
|
2,052
|
1987/1/8 [18:22:54]
|
Demonstrate string functions in strlib.mod
|
|
|
sum10000.mod
|
959
|
1987/1/8 [18:23:00]
|
Computes sum in four different ways
|
|
|
sumofcub.mod
|
1,411
|
1987/1/8 [18:23:08]
|
Find smallest pos. integer from two cubes
|
|
|
ticktock.mod
|
942
|
1987/1/24 [15:00:00]
|
Corrected Modula-2 sample program
|
|
|
topsort.mod
|
2,061
|
1987/1/8 [18:23:18]
|
Topological sorting
|
|
|
tree.mod
|
2,162
|
1987/1/8 [18:23:22]
|
Insertion/deletion of elements in binary tree
|
|
|
useafai.mod
|
499
|
1987/1/8 [18:23:34]
|
No description available
|
|
|
wordleng.mod
|
810
|
1987/1/8 [18:38:48]
|
Read text and count words by length
|