You can know many programs, for example, some programs for cracking passwords, we can stop them while they work, and when we run the program again (with or without entering the same input), they can continue from where they left. I wonder what technique uses these programs?
[Edit] I am writing a program based mainly on recursion functions. According to my information, it seems to me that it is incredibly difficult to save such states in my program. Is there any method that somehow saves the contents of the stack, function calls and data involved in my program, and then when it restarts, it can work as if it had not been stopped? These are just some of the concepts that I got in my mind, so please forgive me if that doesn't make sense ...
source
share