3 ms·
> Reading more, I guess I'm just doing the sorting inside the "next-state relation" of a state machine, so it's done in one state transition While you could de
by pron 9y ago
> Reading more, I guess I'm just doing the sorting inside the "next-state relation" of a state machine, so it's done in one state transition
While you could describe all of quicksort as a function in TLA+ (taking place instantaneously), that's no what you've done. You described a single state transition, but one that doesn't capture all of quicksort, just one partitioning step. To show that the result is sorted, you'd need to do an induction over such concatenations; the thing you're doing the induction over is called state.