sorting - is modern version of the Fisher–Yates shuffle irreversible (i.e. Durstenfeld's version)?

Question

1) Original version of Fisher–Yates shuffle is reversible (see: Reversible shuffle algorithm using a key) but my question is regarding modern version of the Fisher–Yates shuffle i.e. Durstenfeld's versionm -

Given shuffled set S' and random numbers set R (used in shuffling set S to S')

Is this shuffle reversible or irreversible?

2) Shuffling set S using random numbers set R by Sorting algorithm to produce shuffled set S'

Given shuffled set S' and random numbers R (used in shuffling set S to S' by sorting method)

Is this shuffle reversible or irreversible?

Please explain.