Example: Let’s say your user input is 6. Then the number of sequences that sum up to 6 is 11 (including 6 itself). The problem I am having is that it works when the user enters 1 or 6, but if not it ...

I m searching for an algorithm that generates all permutations of fixed-length partitions of an integer. Order does not matter. For example, for n=4 and length L=3: [(0, 2, 2), (2, 0, 2), (2, 2, 0), ...

My head gets stucked finding an algorithm for my problem. Assume I have N Numbers (lets say 4) and I want have ALL X-Partitions (X = N/2) Example: 2-Partitions of {1,2,3,4} are: (1,2) (1,3) (1,4) (...

(This is professional best practise/ pattern interest, not home work request) INPUT: any unordered sequence or generator items, function myfilter(item) returns True if filter condition is fulfilled ...

This is a geometry question. I have a line between two points A and B and want separate it into k equal parts. I need the coordinates of the points that partition the line between A and B. Any help ...

Problem Statement: I have the following problem: There are more than a billion points in 3D space. The goal is to find the top N points which has largest number of neighbors within given distance R. ...

I have an issue with the following code : class quicksort { private: void _sort(double_it begin, double_it end) { if ( begin == end ) { return ; } double_it it = partition(begin, end, ...

I have below a function (from a previous question that went unanswered) that creates an array with n amount of values. The sum of the array is equal to $max. function randomDistinctPartition($n, $max)...