MCPcopy Create free account
hub / github.com/algorithm006-class02/algorithm006-class02 / nsmallest

Function nsmallest

Week_01/G20200343030608/heapq.py:87–102  ·  view source on GitHub ↗

Find the n smallest elements in a dataset. Equivalent to: sorted(iterable)[:n]

(n, iterable)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 3

_heapify_maxFunction · 0.85
lenFunction · 0.85
minFunction · 0.50

Tested by

no test coverage detected