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?

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...

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...

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

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...

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...

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

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...

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...

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

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?

Search for it on Google. It's a nice language that has access to all the Java libraries.

Learn Clojure.

Um, yes you can. For example, you can make a very rough bound: if you have a sum of j values that are each less than or equal to k, then their sum is less than or equal to j*k. You might be able to...

Is this where an instruction contains its addresses? For example, an instruction "0000 0001 0010" might mean "copy the value from register 1 into register 2", because "0000" means "copy", and "0001"...

I don't know.

The Akra-Bazzi theorem ( http://en.wikipedia.org/wiki/Akra-Bazzi_method ) applies in this case because sqrt(n) is O(n/log(n)^2) so you can just use the Master theorem. So BestJewSinceJC's intuition...

It depends on what field you're in. If you even have a desire to ask the question, that's trouble for you.

At the very minimum, if this is an array of N-bit integers, we'll need 2N bits of state, because there's no way to represent two arbitrary N-bit integers with fewer than that amount of information. ...

Let's say I can do it with no variables.

What is your definition of "tree"?

I have never heard the term "fabricated software." Sorry, I don't speak moron.

Especially I would recommend the comp.graphics.algorithms faq. There's a book section in there. I have no idea whether the recommendations are good or not, but if you look at the reviews on Amazon...

Generally speaking you use a graphics card for that... But if you want to implement them yourself, much of the good information is in textbooks. In general, search Google for "graphics algorithms"...

You just need a bunch of pictures of eyes with cataracts and without. Then write a classifier to classify the images.

Psh, Strong is nothing -- check out the names of Alan Grayson's children: http://grayson.house.gov/about/



I'm not in computer engineering. This is a computer science forum, which is a...

Just write your "codes" in Python, test it that way, and tweak your syntax in arbitrary directions so that your code suddenly becomes "pseudo" code.

Thank you, and stop bothering me with your...

That's just saying it takes n-1 comparisons on the first pass, n-2 on the second, n-3 on the third, ... and 1 on the n-1'th pass -- so there are a total of n-1 passes.

So, ask yourself: why? What...

When you run a Theta(n) operation n times, it takes Theta(n^2) time to do. I mean in general if you run an operation that takes n seconds n times, it's going to take n*n seconds.