sorts.strand_sort¶
Attributes¶
Classes¶
Base class for protocol classes. |
Functions¶
|
Strand sort implementation |
Module Contents¶
- class sorts.strand_sort.Comparable¶
Bases:
ProtocolBase class for protocol classes.
Protocol classes are defined as:
class Proto(Protocol): def meth(self) -> int: ...
Such classes are primarily used with static type checkers that recognize structural subtyping (static duck-typing).
For example:
class C: def meth(self) -> int: return 0 def func(x: Proto) -> int: return x.meth() func(C()) # Passes static type check
See PEP 544 for details. Protocol classes decorated with @typing.runtime_checkable act as simple-minded runtime protocols that check only the presence of given attributes, ignoring their type signatures. Protocol classes can be generic, they are defined as:
class GenProto[T](Protocol): def meth(self) -> T: ...
- __gt__(other: object, /) bool¶
- __lt__(other: object, /) bool¶
- sorts.strand_sort.strand_sort[T](arr: list[T], reverse: bool = False, solution: list[T] | None = None) list[T]¶
Strand sort implementation source: https://en.wikipedia.org/wiki/Strand_sort
- Parameters:
arr – Unordered input list
reverse – Descent ordering flag
solution – Ordered items container
Examples: >>> strand_sort([4, 2, 5, 3, 0, 1]) [0, 1, 2, 3, 4, 5]
>>> strand_sort([4, 2, 5, 3, 0, 1], reverse=True) [5, 4, 3, 2, 1, 0]
>>> strand_sort(["banana", "apple", "cherry"]) ['apple', 'banana', 'cherry']
- sorts.strand_sort.T¶