Tags
 IOS SQL HTML C RUBY-ON-RAILS MYSQL ASP.NET DEVELOPMENT RUBY .NET LINUX SQL-SERVER REGEX WINDOWS ALGORITHM ECLIPSE VISUAL-STUDIO STRING SVN PERFORMANCE APACHE-FLEX UNIT-TESTING SECURITY LINQ UNIX MATH EMAIL OOP LANGUAGE-AGNOSTIC VB6

# Algorithm to convert any positive integer to an RGB value

By : user3851311
Date : October 17 2020, 11:12 AM
Does that help You need to first find the range of those values to get the min and max. Then you need to create a colour scale like the bar below this image. You can experiment with different functions to map an integer to an RGB. You need 3 functions R(X), G(X), B(X). Looking at the image below it loks like B(X) peaks in the middle, R(X) peaks at the end and green is somewhere else. As long as you make sure that you never get two (RGBs) for some value of X then you've got your conversion.
code :

Share :

## Find smallest integer greater or equal than x (positive integer) multiple of z (positive integer, probably power of 2)

By : George Jiang
Date : March 29 2020, 07:55 AM
it should still fix some issue If z is a power of two, the modulo operation can be reduced to this bitwise operation:
return (x + z - 1) & ~(z - 1);

## string consisting of positive integer or positive decimal, convert toI number format

By : wcd923
Date : March 29 2020, 07:55 AM
hop of those help? It depends on whether you are allowed to use the standard library functions or not. If so, then, yes, it is just as easy as you described. If not, you will have to parse the string looking for decimal points, minus signs, etc. and convert by your own algorithms.

## How to optimize an algorithm that returns the value of a positive integer x such that f(x) >=0 for a partially known

By : Balaji
Date : March 29 2020, 07:55 AM
will help you Evaluate f(x) for x powers of 2, until you find f(2^n) < 0 and f(2^(n+1)) >= 0. Then bisect until you find the lowest value. It's O(log n) time to find the first power of 2 for which the function is non-negative, and then O(log n) to binary search in the range 2^n to 2^(n+1).

## Algorithm: Factorize a integer X to get as many distinct positive integers(Y1...Yk) as possible so that (Y1+1)(Y2+1)...(

By : Lilek
Date : March 29 2020, 07:55 AM
Your algorithm will find 5 factors:
code :
``````2
2**2
2**3
11
11**2
(11**2 this will be discarded as it is a repeat)
``````
``````2
2**2
11
11**2
2*11
2**2*11
``````

## An algorithm thats gives all possible distinct arrays whose positive integer elements sum to a given number

By : nikyst
Date : March 29 2020, 07:55 AM
wish of those help Here is some idea.
If I'm not mistaken the number of the arrays is 2N-1 and the arrays map to bit patterns codding integers form 0 to 2N-1-1 as follows: