Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with numpy
Search options not deleted
user 178833
NumPy is the fundamental package for scientific computing with the programming language Python.
2
votes
3
answers
434
views
Code to find the sum of the product of all size-n combinations of an array
Here's the code I have made to do the task:
import numpy as np
from itertools import combinations as comb
#A is the target array, in this case, a random array of 1000 elements. … The greatest weakness of this code, I would guess, is the list comprehension, since it doesn't make use of numpy functions. …
- 23
0
votes
Code to find the sum of the product of all size-n combinations of an array
For posterity, here's how this code can be done without a list comprehension:
import numpy as np
from itertools import combinations as comb
subsetSize = 4
elements = 100
targetArray = np.random.rand …
- 23