The time the algorithm takes is a function of more than one variable, so O(n^2 + <something>) is perfectly reasonable notation.


You're missing the point. I'm talking about development time; every serious language has the same time complexities. For any given task, some programming languages take less economic resources than others. You wouldn't use Delphi to code a supercomputer, would you? If you're writing a MacOSX application, Objective C would be the language of choice, no? If you're a scientist doing some numerical calculation, you'd use Matlab or something like it, no? They're the cheapest tools for their respective jobs, and you'd be wasting money/time otherwise.




You can derive a closed form of the summation by simplifying the relation

sum_from_1_to_K(x^n) - sum_from_1_to_K((x-1)^n) = K^n

iteratively or recursively. The algorithm implements this and then evaluates the closed form of the expression.

To quickly answer the original query (though this is an interesting discussion)

There are many languages because well, people needed code systems that could do some process. They were abstracted up from machine language, and at the lowest levels, they do mostly the same things, but:

Some languages have better optimizations and implementations of a program.


I'd say you should pick up the fundamentals of programming first. Figure out what you want to do with a program, the abstracts of data structures and operation automation, then find a language and figure out how to do things in that language. Once you know how to think, picking up any language is pretty simple. But to learn the language, you've got to work at it and figure things out by doing increasingly complex operations.

There are still a fair number of old mainframes and systems out there that run code written in the 70's and 80's, but you should probably go with a more recent language. The level of abstraction will be higher, and you'll be able to find more help... from, for example, people on DaniWeb.