Problem
Try to write an Algorithim that will take an array S with a given size of n and will output a two dimension Array T that, when i is < or equal to q, T[i,q] = S[i] + S[i +1] + ... + A[j]. Note: elements of T are 0 otherwise. Calculate the running time of your algorithm.