ap8pp/prime_numbers
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Add readme

Browse source
This commit is contained in:
ItsDrike 2025-02-26 16:35:19 +01:00
parent c62f027656
commit d8a2f09cde
Signed by: ItsDrike
GPG key ID: FA2745890B7048C0
1 changed files with 15 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
README.md Normal file
View file

@ -0,0 +1,15 @@
# Prime faztorization using IDLE timer
This is a simple GUI application project written in C++ with the Qt toolkit. This application is able to run a prime
factorization algorithm on given number, showing the individual factors that make up the number (if any - e.g. number is
already prime).
The focus of this project is not to make a particularly efficient prime factorization algorithm, rather, to demonstrate
the usage of an IDLE time (0 tick timer), to perform the long-running operation of prime factorization, without it
freezing the program.
IDLE timer is a way to have the computation run in every cycle of the event loop, but only for a single (or a set number
of) iteration(s). This means the program will still appear responsive as the event loop is being re-ran. Note that this
does rely on splitting up the computation, with that single iteration itself being fairly quick.
An alternative solution would be using threads.