Fix leftover VariantWheel class references in sort pseudocode

Thanks to @merwok for noticing!

Signed-off-by: Michał Górny <mgorny@quansight.com>

Author: mgorny

peps/pep-0825.rst

@@ -434,7 +434,7 @@ The ordering MUST be performed equivalent to the following algorithm:
    if both variants have the same number of keys, they are ordered
    lexically by their variant label, ascending. This is done by the
    ultimate step of the example algorithm, with the comparison function
-   being implemented as ``VariantWheel.__lt__()``.
+   being implemented as ``Variant.__lt__()``.
 
 After this process, the variant wheels are sorted from the most
 preferred to the least preferred. The algorithm sorts the null variant
@@ -556,7 +556,7 @@ account for non-variant wheels or tags.
 
 
     # 7. Order variants by comparing their sorted properties
-    # (see VariantWheel.__lt__())
+    # (see Variant.__lt__())
     variants.sort()