QUICK! What's it do!

XXXXXX (aaa, bbb, ccc) = fXXXXXX 0 aaa bbb ccc
fXXXXXX n aaa bbb ccc = if (n>((length ccc)-(length aaa))) then ccc
else if (take (length aaa) (drop n ccc) == aaa) then fXXXXXX (n+(length bbb)) aaa bbb ((take n ccc)++bbb++(drop (n+(length aaa)) ccc))
else fXXXXXX (n+1) aaa bbb ccc

What's with the parens, mate?

And where's your indentation, jerk?

Why are you being too explicit but not explicit enough?  Is that what you are asking?

The real answer is I'm not very good at this, the second answer is that I copied it straight out of the notepad that opened up when I ftp'd it from the school's server.

C'mon, I thought you guys were great detectives.

so, you want us to do your homework?

try rewriting it in a sane way to make it clearer

f n a b c | n > (length c - length a) = c
          | take (length a) (drop n c) == a = f (n + length b) a b ((take n c) ++ b ++ (drop (n + length a) c))
          | otherwise = f (n+1) a b c

take this apart... "take (length a) (drop n c) == a" .. what do you think it means? first of all, this "drop then take" is a "slice/sublist" of the list c. so you could write this as "sublist n (length a) c"... which means: slice the list at position n, with length a. and then compares it to a. So "take (length a) (drop n c) == a" means "is the list 'a' a sublist of list 'c' starting at position n" ?

...and I've given you enough clues already. I know what the algorithm does, but as a haskell aiding teacher (which I am, in an obscure university you probably don't know), I like to let my students think.

Man, get off your high horse dude.  I'm a fucking undergrad and that's my shitty code I wrote in 3 minutes.  I do agree that I formatted it like shit, but I didn't remember how to do the conditional cases at the time.

Regardless of that, you are an idiot for thinking my crappy code was some professors homework.

0wned

so you've never done algorithm recognition?

No, but I did recognition algorithms