


[20060711] 
[20060711] HighPrecision Arithmetic  Calculation of Euler's Number e to Arbitrary Number of Significant Digits
Following is an implementation in C++ of a highprecision arithmetic programme for the calculation of Euler's number to an arbirary number of significant digits. The programme can be run in parallel on any number of networked compute nodes that can be logged on to with a single account sharing the same home drive (e.g., an NFS share) across all compute nodes. This programme does not require parallel computing libraries such as MPI, nor is it dependent on OpenMPaware compilers.


[20060710] 
[20060710] Generalised "Tower of Hanoi" Problem
The following programme implements three methods of solving the "generalised" Tower of Hanoi problem. This problem, like the classical one, consists in finding the optimal sequence of moves for transfering a number of disks between two posts, the only difference in the generalised setting is that the number of posts can be arbitrary.


BACK TO TOP OF THE ARTICLE LIST... 
(C) 20062024 Musa Maharramov  PRIVACY NOTICE AND CONTACT DETAILS 