| def get_random_option_from_weight(options, weights): | |
| ''' | |
| python 3.6 and later | |
| ''' | |
| import random | |
| return random.choices(options, weights)[0] |
Just migrated it from Codepen.io to markdown. Credit goes to David Conner.
| Working with DOM | Working with JS | Working With Functions |
|---|---|---|
| Accessing Dom Elements | Add/Remove Array Item | Add Default Arguments to Function |
| Grab Children/Parent Node(s) | Add/Remove Object Properties | Throttle/Debounce Functions |
| Create DOM Elements | Conditionals |
| def binary_sum(a, b): | |
| ''' | |
| Sum 2 lists of bits of length n. Result a list of length n+1 | |
| ''' | |
| result = [] | |
| carry = 0 | |
| for x in zip(reversed(a), reversed(b)): | |
| c = (sum(x) + carry) % 2 | |
| carry = int((sum(x) + carry) / 2) |
| ''' | |
| From SO | |
| Check for prime. Only need to iterate up to the square root of n because: | |
| If n = a*b, its either a = b (each a sqrt of n) or a != b. If a != b, | |
| either one of them must be less than the sqrt. Hence, only need to check up | |
| to sqrt of n. | |
| ''' | |
| import math | |
| def is_prime(n): | |
| if n % 2 == 0 and n > 2: |