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

Learn Clojure.

Your problem is that you're writing very complicated and redundant code and thus it's hard to think about what your code is doing. Use a simpler algorithm to find and remove the largest and smallest...

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

It doesn't matter. Do what you enjoy. It's not like it's hard to learn a new language later. Realize that you'll have to mostly teach yourself C++ if you really want to learn it, because your...

Don't listen to him, his complaint is logically inconsistent with the fact that you made this thread and using colors isn't going to draw extra attention to the first post of the thread.

Obviously I wasn't talking about his code example because the methods there were not marked abstract.

Either that or the methods were abstract.

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

http://lmgtfy.com/?q=sql

Don't listen to this troglodyte.

It depends on location, but yeah, it's competitive. Do you want to work there?

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

No, next_permutation won't work because his desired output is out of order :)

Hope this helps :)

#include <stdio.h>
int main(void) {
puts("123");
puts("132");
puts("213");
...

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

The U means that it's an unsigned integer literal. size_t is an unsigned integer type that's guaranteed to be able to hold the size of an array. But not a std::string. If you're paranoid you...

Is your call to .length() getting called every time or are you assuming that will get optimized away?

What do you care what other people think?

Don't use any globals (i.e. static variables) and have your function that calculates the answer be separate from the function that prints the answer.

Bah, I meant to uprep this post with "complete win" while downrepping the first, but forgot you could only rep somebody once per day. :(

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.

Static methods are just global functions that could very well have nothing to do with the class you've put them in. Methods that are not static are merely functions that, in their definition,...

There's no such thing as a 'blank space.' An array with 64 elements will contain 64 elements. Some of them will be null, because that's what they were initialized with -- but that's no different...

It basically goes something like this:

1. Read the problem.
2. Think.
3. Write down the answer.

It might help if you ask a specific question, so that we might tell you how we'd go about...

The "second" file from the list? Are you saying you're expecting Sort to look at the elements of the list in some particular order?

If File y is null, what do you expect to happen? What is y.fsPos supposed to do when y is null? (Hint: it throws an exception.)

Apologies for the snark.

You should modify your Compare method...

Scala rules, Java drools.

No, when n is the size of the array, resizing takes Theta(n) time because you have to copy all the elements.

No -- mainly because we don't know what problem you're having, other than that you find it hard.