This problem reduces to the 0-1 Knapsack Problem, where you are trying to find a set with an exact sum. The solution depends on the constraints, in the general case this problem is NP-Complete. However, if the maximum search sum (let’s call it S) is not too high, then you can solve the problem using … Read more
Choosing a random pivot minimizes the chance that you will encounter worst-case O(n2) performance (always choosing first or last would cause worst-case performance for nearly-sorted or nearly-reverse-sorted data). Choosing the middle element would also be acceptable in the majority of cases. Also, if you are implementing this yourself, there are versions of the algorithm that … Read more
Dmitriy is right that you’ll want the Sieve of Atkin to generate the prime list but I don’t believe that takes care of the whole issue. Now that you have a list of primes you’ll need to see how many of those primes act as a divisor (and how often). Here’s some python for the … Read more
There is no universal standard of pseudocode. Just explain what the program does in English. for i from 0 to the size of the word: if the ith character is a space, ….
It depends on what you mean by “pseudocode”. Most people just mean that it is generally simpler and more natural-English-looking, with relaxed syntax when compared to “real” code. Generally in that case I would use something like run_at_start and run_30_times_a_second to cover what Unity does. However if you have a specific definition of “pseudocode” that … Read more