I am doing a internet cafe sweepstakes slot game in vb.net. I want to show the objects based on the payout and the prize money for paylines in the slot game. I tried using MT algorithem but it basically random number based. the final output should not be radom. Inputs Points Ex. 18 or 50 (2 entries) 9 or 25 (1 Entry) prize (from datab...
I have a dataset of approximately 100,000 (X, Y) pairs representing points in 2D space. For each point, I want to find its k-nearest neighbors. So, my question is - what data-structure / algorithm would be a suitable choice, assuming I want to absolutely minimise the overall running time? I'm not looking for code - just a pointer towar...
These exams typically have about 120 questions. Currently, they strings are compared to the keys and a value of 1 or 0 assigned. When complete, total the 1's for a raw score. Are there any T-SQL functions like intersect or diff or something all together different that would handle this process as quickly as possible for 100,000 examinee...
I am thinking of sorting and then doing binary search. Is that the best way? ...
I am currently implementing something quite similar to checkers. So, I have this table game and there are both white and black pieces. Where there are neither white or black pieces, you dno't have pieces. I'm currently doing the GetValidMoves() method that'll return all the current moves one can do with the current board. I am thus won...
I'm trying to figure out how I can iterate in reverse, and forward through this, or atleast call a method in reverse. Here is how it works. Widgets have a std::vector of Widget* which are that control's children. The child vector is z ordered which means that child[0] is behind child[1] (in render order). Each control has a pointer to ...
For a problem that I'm working on right now, I would like a reasonably uniform random choice from the powerset of a given set. Unfortunately this runs right into statistics which is something that I've not studied at all (something that I need to correct now that I'm getting into real programming) so I wanted to run my solution past some...
Recently I challenged my co-worker to write an algorithm to solve this problem: Find the least number of coins required that can make any change from 1 to 99 cents. The coins can only be pennies (1), nickels (5), dimes (10), and quarters (25), and you must be able to make every value from 1 to 99 (in 1-cent increments) using those co...
I came across this question on an interview website - We are given 4 numbers say n1, n2, n3, n4. We can place them in any order and we can use the mathematical operators +, -, *, / in between them to have the final result as 24. Write an algorithm for this - it will take 4 numbers and return false or true whether final result 24 is p...
A partition of a positive integer n is an non-increasing array of positive integers a[1] , a[2] , ... , a[m] satisfying a[1] + a[2] + ... +a[m] = n. m is called the length of this partition. We can list all the partitions of n in an specified order. For example, if we use the rule by which a lexicography sorts all the English word...
I have a graph in form of a rectangular grid, i.e. N nodes and 2N edges, all adjacent nodes are connected. This means it is two-colourable, and hence it is possible to do bipartite matching on it. Each (undirected) edge has a weight assigned to it - either -2, -1, 0, 1 or 2. No other values are allowed How would I go about finding the ...
I know those commands are for two sets. Does there any simple and fast way to do this for more then two sets. I think I can use some kind of loop for this but maybe there are better way. Thank you ...
Hi, I'm a C# developer and I don't have enough information about functional languages, My question that is there any algorithm needs functional language exclusively to be implemented? Regards. ...
I'm looking for some advice on how to go about implementing Gradient (steepest) Descent in C. I am finding the minimum of f(x)=||Ax-y||^2, with A(n,n) and y(n) given. This is difficult in C (I think) because computing the gradient, Δf(x)=[df/dx(1), ..., df/dx(n)] requires calculating derivatives. I just wanted to throw this at SO to ge...
I have 100 vertices and a function f(x,y) that computes the weight of the edge between vertex x and vertex y. f is not particularly expensive, so I could generate an indexed adjacency list with weights, if necessary. What are some efficient, tractable methods for optimizing the n-coloring of these vertices by minimizing or maximizing t...
As long as I've been a programmer I still have a very elementary level education in algorithms (because I'm self-taught). Perhaps there is a good beginner book on them that you could suggest in your answer. ...
I'm looking for an algorithm to generate all permutations with repetition of 4 elements in list(length 2-1000). Java implementation The problem is that the algorithm from the link above alocates too much memory for calculation. It creates an array with length of all possible combination. E.g 4^1000 for my example. So i got heap space e...
I read somewhere that organizing HTML attributes in a certain order can improve the rate of compression for the HTML document. (I think I read this from Google or Yahoo recommendation for faster sites). If I recall correctly, the recommendation was to put the most common attributes first (e.g. id, etc.) then put the rest in alphabetical ...
Hi, I'm looking for a way to round a set of numbers to the nearest rational number while still preserving the total of the set. I want to distribute the total value of '1' amongst a variable number of fields without allowing irrational numbers. So say I want to distribute the total across three fields. I don't want each value to be 0....
Dominator is a value which occurs on more than half positions in an array. For instance in the array: [3, 4, 3, 2, 3, -1, 3, 3] 5/8 > 0.5 The value 3 occurs in 5 out of 8 positions. , so 3 is a dominator: In this array the dominator occurs on indexes : 0, 2, 4, 6 , 7. Write a function int dominator(int[] A); that given an array return...