polars.Series.top_k# Series.top_k(k: int = 5) → Series[source]# Return the k largest elements. This has time complexity: \[O(n + k \log{n})\] Parameters: kNumber of elements to return. See also bottom_k Examples >>> s = pl.Series("a", [2, 5, 1, 4, 3]) >>> s.top_k(3) shape: (3,) Series: 'a' [i64] [ 5 4 3 ]