Your algorithm for rendering a scene of your game results in a maximum refresh rate of 25 frames/s, for a screen (frame) of 1000x1000 pixels, barely within your acceptable range. You have estimated that your algorithm is O(N^3) (worst case tight bound) to refresh your screen consisting of N pixels. What will the approximate refresh rate in frames/s be if the screen size is increased to 2000x2000 pixels? You may express the result in fractional form. Assume that log21000 = 10.
The answer is 24/64 fps. I’m not sure how..
As the algorithm have a worst case scenario of O(N^3) where n is the size of pixel when maximum refresh rate is 25 frames/s
and frame size is 1000×1000 pixels
Now if increase the screen frame size to 2000*2000 pixel the fps rate changes with the change of Refresh Rate (Hz)
As the frame pixel changes the refresh rate also changes
For example for a movie projector it advances from one frame to the next one 24 times each second.
But each frame is illuminated two or three times before the next frame is projected .
So, the movie projector runs at 24 frames per second, but has a 48 or 72 Hz refresh rate.
here the access rate is (1000×1000 )* 25 = 25 * 10^6
So the new fps rate should be 2 * 10^ 6/25 * 10^6
(NOw it will change depends on the initial refresh rate and the fps rate )