Can I Use Berlekamp Factorization in My C++ Polynomial Algorithm?

[SF]

Homework Statement

I have to write an algorithm in C++ to determine the (i)reductibility of a polynomial of degree "n"

Homework Equations

Berlekamp algorithm is preferred.

The Attempt at a Solution

I have Googled for almost an hour now and didn't find anything helpful.

I could use (in order):
- A specific example on how Berlekamp fatorization works.
- Pseudocode

 

[jacksonpeeble]

I'm pretty sure that this is in the wrong category. Try computer science.

 

[SF]

I could also use the mathematical explanation, and I'll make am algorithm from that.