Hello I am trying to implement BST algorithm using Cormen's pseudo code yet having issue. Here is my Code for Node: public class Node { Node left; Node right; int value; Node(int value){ this.value = value; this.left = null; this.right = null; } } and for the Bstree: public class Btree...
Hey, my friends and I are trying to beat each other's runtimes for generating "Self Numbers" between 1 and a million. I've written mine in c++ and I'm still trying to shave off precious time. Here's what I have so far, #include <iostream> using namespace std; bool v[1000000]; int main(void) { long non_self = 0; for(long i = 1; i...
My problem is not usual. Let's imagine few billions of strings. Strings are usually less then 15 characters. In this list I need to find out the number of the unique elements. First of all, what object should I use? You shouldn't forget if I add a new element I have to check if it is already existing in the list. It is not a problem in ...
Consider this example : T(n) = T(7n/8) + 2n I assumed T(1) = 0 and tried to solve it in the following way T(n) = T(7n/8) + 2n = T(49n/64) + 2.(7n/8) + 2n = T(343n/512) + 2.(7n/8).(7n/8)+ 2.(7n/8) + 2n = T(1) + 2n ( (7n/8)^i + ..... + 1) but I could not come to any conclusion about this. I am confu...
Primality Check is probably one of "those" tough problems in mathematics. So, whats is the best and fastest algorithm available to check the primality of a huge number. The most crude and the slowest way probably is: public static bool IsPrime(int i) { for (var x = 2; x < i - 1; i++) { if (i % x == 0) { ...
Is there any Chess game API , purely written in javascipt ? No Flash! Anybody know the algorithm(in general) used in Chess games ? ...
Hi, I received one question "How to delete duplicate entries from an array" Constrain: No new data structure and same array should return only distinct element. So for example If my array is 1,3,3,3,5,55,67,1 then the result should be 1,3,5,55,67 I have solved the problem public void DeleteDuplicate(int[] array) { int ...
I wish to give an effect to images, where the resultant image would appear as if it is painted on a rough cemented background, and the cemented background customizes itself near the edges to highlight them... Please help me in writing an algorithm to generate such an effect. The first image is the original image and the second image i...
Hi all, I have some C++ code where I need to implement cache replacement using LRU technique. So far I know two methods to implement LRU cache replacement: Using timeStamp for each time the cached data is accessed and finally comparing the timeStamps at time of replacement. Using a stack of cached items and moving them to the top if ...
I am trying to understand how red black trees work, assume the transition from first to the second at the picture, I get it this without any problem, after this according to teaching resources, I need to do a local fix on the red G node. So as a fix to the 2nd step, does G simply colored to black to maintain the red-black properties ?...
We have all read about or heard about the stack class, but many of us have probably never found a reason to use the LIFO object. I am curious to hear of real world solutions that used this object and why. http://msdn.microsoft.com/en-us/library/system.collections.stack.aspx I recently saw an example where a programmer used a stack to ...
Why is Least Recently Used better than FIFO in relation to page files? ...
Imagine you sell those metallic digits used to number houses, locker doors, hotel rooms, etc. You need to find how many of each digit to ship when your customer needs to number doors/houses: 1 to 100 51 to 300 1 to 2,000 with zeros to the left The obvious solution is to do a loop from the first to the last number, convert the counter...
I have an array (of 9 elements, say) which I must treat as a (3 by 3) square. For the sake of simplifying the question, this is a one-based array (ie, indexing starts at 1 instead of 0). My goal is to determine valid adjacent squares relative to a starting point. In other words, how it's stored in memory: 1 2 3 4 5 6 7 8 9 How I'm t...
I am trying to determine whether a line segment (i.e. between two points) intersects a sphere. I am not interested in the position of the intersection, just whether or not the segment intersects the sphere surface. Does anyone have any suggestions as to what the most efficient algorithm for this would be? (I'm wondering if there are any ...
Given a scenario where there are millions of potentially overlapping bounding boxes of variable sizes less the 5km in width. Create a fast function with the arguments findIntersections(Longitude,Latitude,Radius) and the output is a list of those bounding boxes ids where each bounding box origin is inside the perimeter of the function ar...
I have a dataset with 100 000 datapoints which I have to plot on a graph. The resulting graph will be about 500px wide, so for every pixel there will be about 200 datapoints, which seems quite unnecessary. I need to find a way to get rid of the excess datapoints without losing the shape of the graph to speed up the rendering. Currently ...
This is in my opinion an abstract problem and I hope I can explain it well. I happened to find the same kind of problem in a completely different project and now I have it again and I would like to avoid it if possible. I'm creating some classes to simplify some tasks for some specific requirements we have in some projects at work. I ...
I am looking at http://stackoverflow.com/questions/101439/the-most-efficient-way-to-implement-an-integer-based-power-function-powint-int. This is the answer they got. I am trying to make it work for C# but I am getting comparing int to bool and all this other stuff. . . and I can't figure out why they are comparing & 1 wouldn't that me...
I have an image of an object taken in a studio. The image is well lighten from multiple sources and stands on a mate white background. the background is also lighten. Most of the shadows that fall on the background are eliminated by the lights but there are still very little light shadows that I would like to remove. Until now, the onl...