Blistering fast:
I ran my number-crunching speed test, as I typically do with new versions of QB64. The test consists of timing how long it takes to compute all the prime numbers from 3 to x, where I run five different x values, and time each one in five separate tests.
All five tests showed obvious improvements. The punch line is that for the longest test, where x = 1,200,007, the time required went from ~ 1.8+ seconds for version 3.14.1 to 1.10 to 1.16something seconds in version 4.0.0. (Same computer, of course.)
Must be the new c++ compiler? Anyway, that's a really substantial improvement. So, thanks, developers!!
I ran my number-crunching speed test, as I typically do with new versions of QB64. The test consists of timing how long it takes to compute all the prime numbers from 3 to x, where I run five different x values, and time each one in five separate tests.
All five tests showed obvious improvements. The punch line is that for the longest test, where x = 1,200,007, the time required went from ~ 1.8+ seconds for version 3.14.1 to 1.10 to 1.16something seconds in version 4.0.0. (Same computer, of course.)
Must be the new c++ compiler? Anyway, that's a really substantial improvement. So, thanks, developers!!