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.

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.

Maybe it's base-64 encoded. Try assuming that and decoding it.

You can't be helped with such a vague request; ask friends and coworkers, or just fiddle around.

You haven't shared your own.

Not much of a start.

First, make your life easier by making a function

(define (name x)
(cond ((pair? x) 'pair)
((symbol? x) 'symbol)
(else (error "i don't know how to handle this case"))))

...

The ironic thing is that your first pasting _was_ indented, if you look at when you quote it.

And I do want to help, I just identified for you the main thing you need to do to implement split...

Well, if you want to implement a split function, the first step would be for your code to handle all the possible cases.

What the ****. Do you realize how bad the indentation is?

Aghh.

Use code tags please.

Both these links suck horribly. On the former, you can't find anything, and it holds no promise of having anything any good for C#, and the latter is just a site that links to other sites'...

If you're asking which is better, C# is inarguably better. There might be JVM languages like Scala or Clojure that are better than C#, though.

All you need to do to fix your problem is look at your code and imagine what a prolog interpreter would do when interpreting it.

Um, write it yourself.

Well you have more problems than just that.

Your second predicate is going to match and override whatever you do in your third predicate. You need to handle nested lists before you handle non-nested lists.

Read this; enjoy.

http://ociweb.com/jnb/jnbMar2009.html

For what OS? My automatic answer is SBCL.

What is the ctr? What are you talking about.

You should regard this as a problem of approaching the list from one of three cases: the previous element having been a list, having been an atom, or...

No, it says you have non-exhaustive patterns!

In particular, you defined the function binadd for non-empty lists with:

binadd (x:xs) (y:ys) n = ...


But you didn't define the function for...

d2b2 evaluates to something of type [Int], right? Which means the expression (d2b2(n / 2):1) is trying to pass an [Int] as the left-hand argument of the (:) function. Since the (:) function is of...

You know what time complexity means or can look it up, right? Why don't you use some reasoning to figure out why time complexity is useful?

Just write some code that does the algorithm you want, there's no "effective" solution.

I'm sure there's some matrix slicing functions you could use; Matlab does those faster than its interpreted...

Sort them by the kind of terms they have, and then group the similar terms together.

Alternately, don't use letters at all in your representation of polynomials -- but this only works if you limit...

If you want to know what the algorithm is, read the whole paper.

This is a complete waste of your time.

I'm pretty sure you want something that works like the following:

(transform '(+ - + - / + - + - + + + / + + + - - - / + + + - - - - +))

It would make no sense to make transform into a macro.

Dynamic typing vs. crappy static typing vs. good static typing; concurrency.

awk '{ system("kill " $2) }'

Why don't you read Wikipedia? It has clear answers.

What does this even mean?

Yeah, it can be used for more than just textual input and textual output. You can do lame graphics without it being a big deal. But you are generally limited by the fact that the language and...

Well, yeah. I agree with calling functions (when used functionally in Scheme) functions. And calling procedures (when used procedurally, with side effects) procedures.

Of course, Scheme isn't...

There are no functions in Scheme, only procedures. That is, the word used in the R5RS specification (and probably R6RS, but I haven't read that) is "procedure". That's why there is a procedure...

It's not apt-get or aptitude that are good, it's the underlying package management system that they use.

And as far as the overlying interface is concerned, I recommend using Synaptic, unless it's...

Looks pretty straightforward. Just because an absurd compendium of redundant types and brackets is what you're used to looking at doesn't mean Smalltalk has a flawed syntax.

Looks like Smalltalk's syntax is nicer looking and more elegant.

What does fork = fork (f,g) x = (f x,g x) mean? Did you mean to type just fork (f,g) x = (f x,g x) for that line? I'll assume you did.

We have fork (f,g) x = (f x, g x). So we see that f and g...

Awesome. Haskell is the best programming language.

I'm not sure how complicated the expressions you're getting are, but there is only one way in which expressions get combined in Haskell: by...

Do you want to change the internal machinations of the ode45 solver, or do you just want to look at the results of the ode45 solver at particularly-intervaled timesteps? If the former, the answer...