Skip to content

A multithreading task implementation to calculate prime numbers using the Sieve of Eratosthenes algorithm.

License

Notifications You must be signed in to change notification settings

Quireg/PrimeNumbersCalculation

Repository files navigation

PrimeNumbersCalculation

The app calculates prime numbers from some intervals specified in xml-based file placed in Asset folder. The app performs calculation in several threads that send results to another thread as soon as a few prime numbers have been found. Another thread has to be waiting for the prime numbers, pulls them (in order how prime number were found) and sends them for displaying through another thread (storing thread). The storing thread should be implemented like a fake tcp-socket with states: establish connection, send prime numbers at a slow pace (to RecyclerView), closed connection, reconnection if the opened connection was unexpectedly closed. Parsing xml should be performed without any (Android internal or 3rd party) library.

Calculation and threading is backed with JavaRX

UI

Direct link: https://github.com/Quireg/PrimeNumbersCalculation/releases/download/1.0/app-release-unsigned.apk

License

MIT License

About

A multithreading task implementation to calculate prime numbers using the Sieve of Eratosthenes algorithm.

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages