“The more widely used FOSS is, the
sooner we obtain a cosmic win^win.”
– W. Stewart, 2013-11-07.
that creates beautiful structures and moves them
around with precision. To the best of the author's testing they
are all bug
free, however this is an opinion and not necessarily a
fact ;-) All are open source GPL3 licensed.
Traveling around a vertex in 3D and 4D
hull of a set of points S from
any dimension d,
with very efficient
time and space complexity,
for dynamic updates. Includes
unwrapped recursion using a
list for predictable storage
and time control, and a highly
optimized near linear quicksort.
Documented in this PhD
thesis with LaTeX typesetting
software that creates particularly
formula, for example
on pages 27 and 63. The
graphs in Chapter 6 were
separate software, then manually
so are unfortunately not
included in the soft-copy
Representation - WATFOR (1990)
Provides a proportional representation implementation
for the voting results of an election, adding members
with the "next highest support". Includes
an efficient quicksort in
Waterloo Fortran. Part of a submission to the 1989 Canadian
Royal Commission on Electoral Reform.
Logic Linear Programming - FORTRAN
Solves the linear
using the fuzzy
logic algorithm described in
Fuzzy Programming and Linear
Programming with Several Objective Functions, Zimmermann,
Fuzzy Sets and Systems, North-Holland Publishing Company,
1978, pp. 45-55.
Search Trees - IBM
all the operations needed to use the self-balancing
search data structures AVL
trees, including make, insert, delete, traverse,
balance, and rotate.
A simple solution for Previous, Next, and Up navigation of a website,
originally developed for LivingInternet.com.
The essential programming style and bug identification process, prepared for
first year computer science students.