This article is a follow-up to my text about turning a pyramid like structure into a graph (which looks a lot like a tree, but isn't one), finding all the paths in the graph and collecting all the values held by vertices in each path of it. In the first article I stopped at ...

Suppose you have a structure like one shown below, lets call it pyramid, and are asked to find all the paths from top to bottom in it, and perhaps also to do something with values of nodes in each path, add them or find their product etc. . How do you achieve these things? In ...

Suppose, that you need to compute 25! in PHP. It is a fairly large number. PHP will tell you that it is 1.551121004E+25, nice and short. No surprises here. Let's look under the hood, though. Sometimes you need, for example to do something with each digit of the number. So, ...

This article is a result of a fairly well known computer programming problem I came across online some time ago. Essence of the problem was about finding the longest Collatz sequence, that is the largest number of terms for a number less than N, with N being 1 000 000. For ...