I was having a kind of …insomnia attack last Friday night, so I decided to search the openSUSE repositories for interesting applications. I was using openSUSE (11.1) at the moment, with lots of additional repos [1] from the excellent Build Service, so there were a lot of things there to explore. One thing led to [...]
The goal of this project was to create a class (named lifo) of Last-In-First-Out Lists (Stacks) of integers with variable length. The class actually defines a new Data Type, named lifo. Each variable of this type will be a LIFO List. Of course, the class must have defined some operations (member-functions) for handling the lists, [...]
This Pascal program finds the value of a Nth order polynomial: implementing Horner method without using any complex arithmetic in Fortran 77. Obviously, it can find complex values, for complex x’s, but without complex arithmetic. The program also uses ANSI codes to clear screen.
This little Fortran program, originally written in DOS, uses the arithmetic sequence to find the root of A. All you have to do is to enter A and a guess value . Caution: This program is very old; it uses Escape codes to clear the screen. In DOS, it needs the ANSI.COM driver. I haven’t [...]
This is a Prime Numbers’ Generator from Integers up to 2,000,000,000, written in Turbo Pascal. This program generates the prime numbers up to a given arithmetic limit, using 4 (four) different known methods. They are all based in modulo algebra. The methods are: This uses the mathematical definition of a prime number to generate them. [...]
Οι συνταγές μας Περιοδικό Linux iefimerida