Reply to thread

Message: <blockquote data-quote="Ayeshlive" data-source="post: 18245598" data-attributes="member: 363439">here is my challenge. (I work for a company as a security audit, and this is a cryptography 101 algorithm. There are no "perfect" algorithms and such algorithms are not practical for today. But if you can write a good one, you are many steps ahead in your programming career! At least give it a try. You need to write an algorithm that accepts a 32 bit integer. Then, it has to provide two integers back, that when multiplied, produces the given number. Now the challenge is that BOTH of these returns values should be Prime numbers. If it can't find a prime number factorization, it should return 0. Example: input = 35; output should be "7 * 35". Input = 143; output should be 11*13 because 11*13 = 143. You can find examples off the internet. But try to write one first. Winner is chosen after a reasonable number of submissions. Fastest code wins. At the time of evaluation, a sample input will be given, and the snippet that takes the smallest amount of time yet provides the correct answer wins. </blockquote>

Top Bottom