Algorithms matter

Algorithms shall always be applied

Whenever possible, we will apply the latest algorithms for fast and efficient running of the software. Herewith some examples with source code.

Find Leader Algorithm

find leader algorithm

Algorithms do matter! Herewith an example of an efficient algorithm to find the leader in a sequence.

The source code for this example is available on Github. More detailed information you can find in the Readme file.

Maximum slice algorithm

The Maximum Slice algorithm will find fast and efficient the slice with the highest sum in a sequence.

The source code for this example is available on Github. More detailed information you can find in the Readme file.

Maximum Slice Algorithm
Maximum Slice Algorithm
Sieve of Eratosthenes Algorithm
Maximum Slice Algorithm

Sieve of Eratosthenes Algorithm

The Sieve of Eratosthenes Algorithm is here applied to find efficiently the divisors in an array.

The source code for this example is available on Github. More detailed information you can find in the Readme file.

Coding Convention

  • We use our skills to enhance the readability of the code and to simplify modification

  • Our lines of code appear as if they were created by a single person

  • We apply the "Don't repeat yourself" (DRY) principle to reduce repetition and redundancy.

  • We apply single-responsibility principle (SRP) where every module, class or function has responsibility over a part of the program's functionality

  • We use as much as possible Constants in our programs, instead of hard coding

Contact

For any further inquiry or a quotation for our services please contact us at the soonest.

  • info@manyroads.dev

  • + 49 6325 1840844

  • Mo - Fr 8:30 - 17:00