Given the level of abstraction in most modern programing languages/ operating systems it's really hard to say that any modern language could implement quicksort

Given the level of abstraction in most modern programing languages/ operating systems it's really hard to say that any modern language could implement quicksort in the most strict definitions. For example, is a quicksort 'in-place' if your memory gets swapped to disk?