See what happens with simple c code.

Clearly, c also stands for "see" and these are mainly snippets which show very simple but often, powerful effects

There seems to have been changes in this, and unistd.h is no longer the header for this, but rather getopt.h.

The name is a mnemonic for "Go around array" and it's used for comparing the each element of an array with the rest, one by one, in circular fashion.

Coded much later, but seems to be similar to the above. PairWise Comparison Operations

Mnemonic MIR Upper Triangular MAtrix matrix transformation: principally mirroring triangle matrices.

This was the result of a game presented by Nuritas when looking for bioinformaticians. a peptide sequence with heterogeneous quantities of the different AA's (as is normal) must be converted to a sequence with equally represented AA's, and the smallest subsequence with those change must be calculated. Because it's a single subsequence. Luckily the length of the sequence is an integer multiple of the number of the AA's used which happens to be the full complement of 20.

There was a number of function here that I have already coded elsewhere ... and I did try to looks for them but they didn't come up (especialy the codon code from Uppsala), and it was easier to code from zero.

Recursion is a key aspect of computing, but being attached to the imperative style of programming, I don't use it much. But the generation of kmers it turned out to be an ideal approach as it allows arbitrary embedded of for loops inside each other. The python version is handled very easily, while the c version requires more work.

However one or two notes about recursion are in order.

• it's imitative of the stack, which is an internal resource of the computer
• however, just be it's internaly used, it does not mean that it's exposed to usage.
• the stack is a FIFO arrangement of commands primarily, not data nor storage.
• recursion and trees and very very related.
• recursion also closely related to the Kronecker product.
• most of the c progam is recording the progress of the recursion tree by storing intermediate results properly in an array

"Array OWNS Array". Quite an interesting exercise that I hadn't thought of before. THis program works on the simplest implementation where with have an owning array, later called parent array with a limited number of elements, in this case floating point values between 0 and 1, generated randomly. We want to be able to take a second, and bigger array of the same type which can be called a child array and allocate its elements to the elements of the first array based on distance to the nearest element.

Returning to this, some explanation is needed. IrnN any case "parent" array is better than owning array, and child array for the subordinate array. THis nomenclature is actually used internally.

But dynmax is really pretty incomprehensible. The name, for a start. It seems to render the so called nodes into integers, but then was possible is that two nodes can fall on the same integer in the parent array, which is not really part of the user-case. Yes, dynmx, very poor name, is jus the the max value of the integers that will be rendered.

The "i" version of this program is not apparent. The program is really nearest child to parent. Either above or below. Clearly the parent array is some sort of partitioning array.

A quick string comparator when strings are short (<17chars)

strtok at work. Note the string before the first delimiter best taken separately

These programs use getline to read a textfile but then they do some ordering on the columns on the rows. Unsure.

This one very in the tradition of chwats ... tring to work out signed and unsigned shorts. I was having trouble with my wav files, in adding signed shorts, and this was an experiment to see the different things that can happen. Couldn't reproduce though. Later, then I could yes.

Casting unsigned shorts to integers directly isn't such a fab idea. It may be that the underlying bits don't change, but certainly the representation in printf() can drive you a bit mad as you see additions of shorts not working the way you expect at all. As this program showed, the trick is to cast unsigned to signed short first, and then to int.

Got to thinking about my many untreated tcx and gpx and how an alternative attack is to use sscanf(). It's nto regex, but maybe it could be enough see this post: https://stackoverflow.com/questions/24483075/input-using-sscanf-with-regular-expression Remember %*s the asterisk is the don't-care qualifier.

how to use printf("%.*s") sometimes quite useful