So, Avatar is an awesome movie. You need to see it in 3D. It is mandatory.

Well you better do something about it. It wouldn't be fair to stop me after 3 hours, when it was funny, but let these doodooheads go on for weeks and weeks.

To heck with SAS. It is software that deserves to die.

Take Japanese and then you can get really freaking tired of all the otakus in your class.

Edit what? A string? What does editing a string have to do with measuring the distance of two strings? What are you trying to do? Why do you want to compute the distance?

Objects in C++ can't change their type. You can have a variable of some pointer-to-animal type and then assign a new pointer-to-animal to that variable though.

http://en.wikipedia.org/wiki/Fibonacci_search_technique

What kind of Lisp? Common Lisp? Use SLIME. Emacs Lisp? I guess not, because then you wouldn't need to ask.

If there are 32-bit instructions, that means there are 2^32 total values these instructions could have. If addresses are 12 bits, each 2-address instruction has 2^24 values it could have. So...

The compiler doesn't see their bodies. The functions are already compiled into a library. Lookup detailed descriptions of how compiling and linking works -- this is the sort of thing where...

For example, suppose you have a function
int f(int n) {
if (n == 0) {
return 1;
}
else {
return n * f(n-1);
}
}
We want to measure its cost. But before we do so, we'll...

Don't use non-open source revision control systems. They're no good anymore. Use Mercurial. Don't use Subversion unless you have large binary files or the need to control permissions for...

Create a recursive formula for the time complexity and figure it out from there.

Take the sum and multiply by the step size. It's that easy.

Or see Simpson's method.

Edit: Gah, of course you have to have fractional endpoints. So treat the first and last segments specially.

To represent an N-bit value whose value could be anything, you need.... N bits. Which eats up 2^N possible numbers. You have 2^20 available numbers.

It apparently does, if he's considering it.

I also think the probability of the linear algebra class sucking is higher than the intro to mathematical proofs class sucking. Math department tend to...

Why don't you just count? Each two-address instruction eats up enough of the available instruction space to represent 2 addresses. Each one-address instruction eats up enough of the available...

The real value of a forum like Daniweb is in how it helps the people who search for problems in the future. The needs of the OP are immaterial.

I think this sort of thing should just be... intuitively straightforward. The only part that might not be is the question of how to deal with different operator precedences.

What is a program? ...

You need to explain your problem better. What is a subdomain? Why are "keys"? What about the binary tree lets you search efficiently? If it's just a binary tree, and not the more specific case of...

The reason it exists is because somebody put it there. Supporting the marking of threads as solved is like supporting the death penalty: innocent people will get executed, and threads with bad...

The trouble with trying to argue with me is that you don't disagree with me about C++.

Edit: What you disagree with, apparently, is the practice of providing reasons for the things you say.

I don't care about you or your appeal to self-authority. I'm going to assume you don't know what you're talking about because most people don't.

And stop having a chip on your shoulder, and I was...

Here's a nice review by somebody I consider smart: http://scienceblogs.com/goodmath/2009/11/googles_new_language_go.php

Hey, you're right, it is easy for me.

You need to tell us the error message and what line it's on, and you need to use CODE tags for us to want to look more closely.

Let's look at this one. I'm going to ignore the swap for now.
Iteration2:
public static long dominoes(long x, long y){
long temp;
double koeficient = 0, faktor;
for(long i=0; i<=x+y;...

Take Introduction to mathematical proof. It will make you a better, smarter programmer.

Another reason is that if you find yourself interested in graphics, it wouldn't be that hard to pick up the...

I think that quote is referring to type safety. Not to mention monkey-patch safety. If you know how to use C++, it's a very safe language. C++ provides the best "resource safety" of any mainstream...

That's just crazytalk.

See you on IRC.

Addition is O(n) where n is the number of bits in the BigInteger, and multiplication depends on the algorithm used: http://en.wikipedia.org/wiki/Multiplication_algorithm . That depends on the Java...

Well, I like it. In particular, slices, rather than pointer arithmetic, is simply The Right Thing.

I have been looking for a good safe systems programming language, and it seems like garbage...

I just automatically downvote every one of your posts. It's like when a girl punches you -- it means she loves you. Except I'm not a girl. And I don't love you. You're the closest thing to serkan...

You are popular the way Bill O'Reilly is popular.

First, start working on it. Then, after you've shown some progress, you'll have an easier time convincing somebody to help you.

yeah

Why would you pay for something stupid? Maybe you are stupid :P

your brain

Just remove a letter from the first string, print that letter, and do a recursive call. Of course, you'll want to do this for each letter.

If you're writing production software, you should use openssl or gpg or whatever -- you shouldn't be calling cryptography routines yourself, and especially you shouldn't be writing them, unless you...

openssl is open source.

Uh... what do you want this for?