Search:
Type: Posts; User: razzle
Search:
Search took 0.03 seconds; generated 14 minute(s) ago.

February 26th, 2015, 11:31 AM
What's POS? Point of Sale?
With no information whatsoever the best languages are Java, C# and C++ because these are the dominant modern mainstream languages.
Since it's your project I suggest...

February 26th, 2015, 12:08 AM
Although the formulation I suggested (shortest alternating (redblue) path in a directed graph) will work and seems fairly standard I cannot promise it will be better than your article and I haven't...

February 25th, 2015, 08:27 AM
Too bad. :)
I was about to suggest a formulation based on the shortest alternating path in a directed graph. The "alternating" comes from the fact that people are moving back and forth through...

February 25th, 2015, 12:23 AM
Thank you. I wasn't sure I understood the problem so I just made the proposition in my previous post in the hope the OP would return and discuss.
It looks like an optimal strategy involves...

February 24th, 2015, 11:06 AM
Yes it seems like an optimal strategy. The person with the lowest time carries the item all the time. This itemcarrier is then accompanying one person at a time through the gate and is then...

February 24th, 2015, 02:57 AM
C++ offers little but still some support for runtime type checking. It has its uses but shouldn't be overused, especially not to hide design flaws.
http://en.cppreference.com/w/cpp/language/typeid

February 23rd, 2015, 03:23 AM
So when you do your own exponentiation (represented by operator ^) you don't get the same result as if you do exponentiation as suggested by someone else on the net (represented by operator $).
...

February 22nd, 2015, 06:10 AM
Based only on the quote above it seems a tree would be your preferred choise if it wasn't for the repeated subnodes?
But if there are many copies of a subbranch in a tree they can be replaced by...

February 21st, 2015, 03:15 AM
http://forums.codeguru.com/showthread.php?549329topicsaboutlists3hardquestions

February 21st, 2015, 03:10 AM
This is not a puzzle anymore like the ones you posted before (which tests general logical aptitude).
This is a knowledge question you must work out on your own because otherwise you're no...

February 20th, 2015, 06:50 PM
Going forward with C++ 11, Stroustrup has this example (6.3.5 Initialization),
X a1{v};
X a2 = {v};
X a3 = v;
X a4(v);
He strongly recommends the first one. Still, as die hard C programmer...

February 20th, 2015, 06:15 PM
F is called 70% of the time. That means F is not called 30% of the time and during that time G is called 30% of the time. So G is called 30% of 30% of the time which is 9% of the time.

February 20th, 2015, 05:54 PM
You only need to know that a = b mod m means a<m.
First have a look at proposition i. On the left side a+x must be smaller than m+m but on the right side b can be infinitely big so this...

February 20th, 2015, 02:10 AM
How well aquainted are you with the method you want to implement? Can you describe it in precise steps preferably mathematically? That's how you develop an algorithm. You always do that before you...

February 20th, 2015, 01:58 AM
It's better to continue on the same thread,
http://forums.codeguru.com/showthread.php?549283bayesianmodelingandlinearthresholdingmethodinhistopathologicalimage

February 19th, 2015, 12:20 PM
It's an alternative to,
SensorBase* const sensor = mSensors[i];

February 19th, 2015, 06:59 AM
Sure, the algorithm I suggested will solve the problem but not necessarily in the most efficient way. Also there are quite a few details left such as for example,
1. How to check for BC in the...

February 19th, 2015, 06:03 AM
This seems to be a recent review article of possibilities,
http://www.sersc.org/journals/IJAST/vol62/6.pdf
See fig. 2.

February 19th, 2015, 04:53 AM
Well, this problem looks like a set cover problem and in that case it's in NP. This means any polynominal "whiz" solution can only be approximate. But the problem can still be solved of course only...

February 17th, 2015, 04:51 AM
Another approach is to actually "draw" the circle using a circle drawing algorithm. See the example C# implementation here,
http://en.wikipedia.org/wiki/Midpoint_circle_algorithm
You could...

February 16th, 2015, 06:31 AM
I've never worked with 23 trees but it seems they're used because they're balanced. It means the fact that it's a 23 tree doesn't really influence your question right? It could be any search tree....

February 15th, 2015, 06:03 AM
Well, experience comes from doing by yourself.
Meekly succumbing to the consensus of a group is not obviously better than boldly going it alone learning by trial and error. Which is better very...

February 15th, 2015, 04:08 AM
Well okay, I'm willing to soften that to: Java is arguably the best (*) allaround language.
If you still think I'm wrong please motivate. :)
(*) For an unexperienced programmer of highschool...

February 13th, 2015, 06:51 PM
In a counting sort you would need an array of size max(m^2, n^3) for the counting.
To set up the counting array you need to first scan the (n+m) size array once but then you also need to scan the...

February 13th, 2015, 05:42 PM
If you're in highschool and feel drawn to programming I think you should do everything you possibly can to get into a well reknown college/university and pursue a degree in some...

Click Here to Expand Forum to Full Width
This is a CodeGuru survey question.
Featured
