min_n and max_n
This commit is contained in:
13
snippets/min_n.md
Normal file
13
snippets/min_n.md
Normal file
@ -0,0 +1,13 @@
|
||||
### min_n
|
||||
|
||||
Returns the `n` minimum elements from the provided list. If `n` is greater than or equal to the provided list's length, then return the original list(sorted in ascending order).
|
||||
|
||||
Use `list.sort()` combined with the `deepcopy` function from the inbuilt `copy` module to create a shallow clone of the list and sort it in ascending order. Use `[:n]` to get the specified number of elements. Omit the second argument, `n`, to get a one-element array
|
||||
|
||||
``` py
|
||||
from copy import deepcopy
|
||||
def min_n(arr,n = 1):
|
||||
numbers = deepcopy(arr)
|
||||
numbers.sort( )
|
||||
return numbers[:n]
|
||||
```
|
||||
Reference in New Issue
Block a user