Apr
21
awarded Popular Question
Apr
20
comment Find a subset with sum within a range
i don't know if that'll help me, sounds super inefficient. I am dealing with ranges of up to hundreds
Apr
19
comment Find a subset with sum within a range
I don't see how this answers this question
Apr
19
comment Find a subset with sum within a range
How can I apply the subset sum problem to a range though?
Apr
19
comment Find a subset with sum within a range
Well the thing is, yes, sorting would be the first step for sure, that's why I wrote it already sorted. The problem is that there might not be a single element within the range and I might have to resort to use 2 or more. For the case, I am working on it will be very likely that it'll be a subset of elements rather than a single element
Apr
19
asked Find a subset with sum within a range
Apr
18
accepted Find 2 subarrays from an array of n elements that have equal or close to sum of their elements
Apr
17
answered Basic circle physics collision logic
Apr
17
comment Basic circle physics collision logic
each component times the radius
Apr
17
comment Basic circle physics collision logic
so normal_x = acos(Cy-cy/Cx-cx), normal_y = asin(Cy-cy/Cx-cx) ? That doesn't seem right
Apr
17
comment Basic circle physics collision logic
how can i calculate the normal vector? I think vector - 2 * Dot(vector, normal) * normal would give me the resulting vector
Apr
17
comment Basic circle physics collision logic
Yes, but I am not sure how to do that, because my attempt to do that does not seem to work properly.
Apr
17
revised Basic circle physics collision logic
edited title
Apr
17
asked Basic circle physics collision logic
Apr
14
answered Find 2 subarrays from an array of n elements that have equal or close to sum of their elements
Apr
14
comment Find 2 subarrays from an array of n elements that have equal or close to sum of their elements
True, and if I can find one subarray that equals or is close to the k then I can just get the remaining elements in the original array to be the second subarray.
Apr
14
comment Find 2 subarrays from an array of n elements that have equal or close to sum of their elements
yes, I thought of that but what if the last element is super large though. Is there maybe any established algorithms to do something similar already.
Apr
14
asked Find 2 subarrays from an array of n elements that have equal or close to sum of their elements
Feb
26
answered Collapse Computed Properties and Property Observers in editor?
Feb
4
comment Do I get charged for attempting to publish messages to disabled endpoints?
so, it's probably best to do a clean up job based on inactivity time on my side to get rid of potential disabled device endpoints? (to lower costs)
1 2 3 4 5