I would like to ask you what does happen whith the variables on the dynamic memory (created with new) if you force the closing of the process, before the call of the delete instruction?... Are destroyers called anyway?... What are the consequences of that?

Destructors are not called, no, but since dynamic memory is managed by the OS, when your process dies, the operating system cleans everything up for you anyway (and same for most resources like file descriptors, sockets, etc..). That doesn't mean you should not care to free your memory before ending your program, you should always do it, because if you need to save your program's state to disk somehow, you'll have to make sure it's done because the operating system won't do that for you, but it does mean you need not worry about memory getting lost when your process is killed.

Actually, it depends what you mean by "forcing" the process to close. There's a big difference between an API like TerminateProcess() and ExitProcess() under Windows, for instance.

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.

No, all virtual memory is released when the process is terminated (though the process may take a while to terminate as I/O is difficult to interrupt, at least under Windows). However the program (or attached libraries) may need to do special cleanup work which TerminateProcess() won't let them do, unlike ExitProcess().

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.