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 python-2.x
Search options not deleted
user 178833
Python 2 is the predecessor of Python 3 and its last version, Python 2.7 was formally released on July 3, 2010. Use this tag along with the main python tag to denote programs that are meant to be run on a Python 2 interpreter only. Do not mix this tag with the python-3.x tag.
2
votes
3
answers
434
views
Code to find the sum of the product of all size-n combinations of an array
The title is a bit of a mouthful, so here's a quick example:
You've got an array, maybe just the digits 1-3, and you want to get the sum of product of all size-2 combinations of the array. Those comb …
- 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.ran …
- 23