|
for z!=1 
"Throughout human history, we have been dependent on machines to survive. Fate, it seems, is not without a sense of irony. " - Morpheus
|
|
|
|
|
Can any one tell me which is the best book of Advance Algoritham analysis
|
|
|
|
|
We used Introduction to Algorithms[^] (called "CLR" or "CLRS" for short) in my algorithms class, and it was a pretty good book.
TAOCP[^] is also supposed to be very highly regarded, but I have not personally ventured into that territory yet
--
Marcus Kwok
|
|
|
|
|
|
Mythbusters had a recent episode on this problem. They used huge and thin. Didn't hurt to have a forklift to help horse it around after it got thick.
The evolution of the human genome is too important to be left to chance idiots like CSS.
|
|
|
|
|
The user provides the start, end and control points for a bezier curve on a bitmap. I need to look a certain amount above and below each point on the curve based on an int X location and rounded Y location. Is there a formula anyone knows of which will calculate the Y value of a bezier curve given the X value and the four points?
|
|
|
|
|
Hi,
I dont think it is easy to find y from x, given that x(t) and y(t) are both polynomials.
But maybe you could modify y(t) by adding your fixed vertical distance, and then walk
the modified bezier.
|
|
|
|
|
It is impossible to calculate y based on x because Bezier curves are implicit, meaning that they are not necessary functions. In this article:
http://www.codeproject.com/useritems/ArrowRenderer.asp I've provided source code that helps calculating <x,y> pairs of Bezier curve
Michał Bryłka
|
|
|
|
|
Can anyone please guide me implementing Tree Data structure in C#. Since we dont have a pointer type in C# I was implementing it using in built Array data type but I have very tough time implementing it in array.
Since I have already implemented this tree strucure in C, C++ so I have the cocept. Now if you can give me little guidance and I hope I can implement it.
Thanks in advance.
Arindam D. Tewary
|
|
|
|
|
How this question fits here ?
Use appropriate[^] forum instead.
|
|
|
|
|
Dear Prasad,
I am sorry if i have posted it in wrong forum. But dont you think someone can pop up there also to ask me to post the same in algorithm forum ( as data structure and algorithm comes with one another) here ?
Event I dintk ask specific implementation.
But I just asked idea about how to proceed taking C# language in mind and the reason is also ABSENCE of POINTER TYPE in C#.
Once again I am sorry.
Thanks,
Arindam D Tewary
|
|
|
|
|
Arindam,
You mentioned, you have already done this in C++. So only remaining part here I can see is, how to achieve this using C#. Thats why I suggested to C# forum.
|
|
|
|
|
Dear Prasad,
Thank you very much.
Thanks,
Arindam D Tewary
|
|
|
|
|
These articles here on CP may help you:
Generic Tree <t>[^]
A Tree Collection[^]
"Programming today is a race between software engineers striving to build bigger and better idiot-proof programs, and the Universe trying to produce bigger and better idiots. So far, the Universe is winning." - Rick Cook www.troschuetz.de
|
|
|
|
|
Dear Stefan,
Many thanks to you. I am seeing the article link you have posted is really very helpfull. 
Thank you very much Stefan.
Thanks,
Arindam D Tewary
|
|
|
|
|
Switch to unsafe mode, and freak out with pointers. It's your memory and you paid for it :->
ASP - AJAX is SEXY. PERIOD.
|
|
|
|
|
can u please tell me which compression technique will be better of video
hi this is gayatri
|
|
|
|
|
define better.
Is it better image quality on playback? Smaller file size? Lower CPU load during playback? Lower CPU load during encoding? More resistant to bit rot without total failure?
--
Rules of thumb should not be taken for the whole hand.
|
|
|
|
|
<b>How can i print 1 to 10 with minimum number of if condition?
Note: With out using loop and goto.</b>
Chandan Dey
|
|
|
|
|
printf("1 2 3 4 5 6 7 8 9 10");
Zero if conditions, no loops
|
|
|
|
|
This is clearly homework people. You should know better.
--
Rules of thumb should not be taken for the whole hand.
|
|
|
|
|
Indeed i should!
I'm getting too frustrated with my algorithm that "So Nearly" works that i felt like solving something simpler. I hadn't really considered the source of the puzzle.
I stand chastised.
Russell
|
|
|
|
|
|
no loop, and no goto as requirements are something that would only make sense in the context of a cheater trying to avoid doing his schoolwork. Such posts should be answered with a LARTing, not a proper solution.
--
Rules of thumb should not be taken for the whole hand.
|
|
|
|
|
I believe Michael was handling the situation admirably.
And I guess he knew what he was posting...
Cheers,
Sebastian
--
Contra vim mortem non est medicamen in hortem.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
