What's the deal with Deno? We talk with a major contributor to find out. Listen now.

Questions tagged [summation]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
2
votes
0answers
46 views

How to parallelize a summation efficiently

Say I have an array a[1..n], and I want to output an array s[1..n] with s[i] = a[1]+...+a[i]. What is the best (or at least standard) way to do so in parallel? The way I can think of doing it, given m ...
0
votes
0answers
34 views

Reconstructing an Array via Time-Intensive Subset Queries

I am trying to design an algorithm for a problem, and the following is an auxiliary problem for which a good solution would imply a faster algorithm for the original problem. I am given access to an ...
0
votes
3answers
72 views

Find the smallest group of numbers with sum bigger then $X$

Given a list of numbers $S$ where $0 < s_i < 100$, find the minimum sum group of numbers with a sum bigger than $X$. Each number can be used multiple times. Ex: for $S = [3,4.1], X = 10$ the ...
-1
votes
2answers
70 views

What would be the complexity for this relation?

The function: for (int i=1; i<n²; i++) for (int j=i; j<n; j++) print(j) Putting it into a relation, I got: $C1 + \sum_{i=1}^{n^2}(C2+...
0
votes
1answer
48 views

How to solve recurrence

I have tried solving it using substitution. Apparently, it is exact for some $n$ and the order of the general solution can be found from this exact solution. By substitution I got the following (not ...
0
votes
1answer
54 views

Calculate the number of iterations in unusual nested loop

I am trying to calculate the number of iterations of a sequence of nested loops of the form: \begin{equation} N = \sum_{j=0}^{j_T} \sum_{k=0}^{j} \sum_{l=0}^{k} \sum_{n=n_0}^{n_T} 1 \end{equation} ...