Members - Reputation: 100
Posted 18 March 2012 - 09:46 PM
In its 1st phase it was just a sprite moving around, it worked.
I added screens, and the sprite. Each screen has it own file, the sprite movement it's in a spite sheet.
According I move backward/forward I change the screen or the sprite 'walk' through differents screen, jumps, etc.
I only once load the sprite file, the other ones, which contain the differents, screens (backgrounds) are loaded on demand (and I free them as well). I mean, if it's time to screen2, I do a SDL_FreeSurface(screen1) and then I load screen1.
It seems it's ok, but after a seconds the game gets stuck, it freezes.
What could be wrong?.
Thanks, and regards
Crossbones+ - Reputation: 9610
Posted 19 March 2012 - 12:54 AM
(you can do that in Linux, right?).
OP: try and figure out where the problem is coming from first, by either breaking as Nypyren suggests or scatter some printf's around your code (ghetto debugging). Then you can usually either resolve the issue if it's a logic bug (infinite loop, condition never being satisfied, etc...), or if it's an error message from one of the API's you're using you can usually google it and find an answer, and ask here if nothing comes up. As it is now your question is much too general and we can't really give any specific help.
The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.
- Pessimal Algorithms and Simplexity Analysis