OK, I really don't know much about the LLL since it was invented at the time I was studying LinAlg and never got as far as our course work. It was being used by Conway, Norton and Parker when I was doing my PhD, so I heard something of it, but never implemented it, as I was working in a different area.
However ...
Here's (some/most of) my understanding.
We're working in R^n, and suppose you have n linearly independent vectors b_1 to b_n with integer coefficients in the obvious basis. These vectors span R^n, but you need to use real numbers as coefficients to do that. If you only take linear combinations using integer coefficients then you get a lattice in R^n.
Exercise: Prove that (1,5) and (2,3) are linearly independent in R^2
Exercise: plot a portion of the lattice spanned by (1,5) and (2,3) in R^2.
The same lattice might also be spanned by different vectors, and in particular, you may be able to find a collection of shorter vectors that span the same space.
Exercise: Find two shorter vectors v1 and v2 that span the same lattice as the one above.
The new vectors must also be in the same lattice, and so must be representable as an integer linear combination of the original vectors.
Exercise: Represent v1 and v2 as linear combinations of (1,5) and (2,3)
Basically LLL consists of a measurement of how well you're doing so far, and a way of replacing one of your existing vectors with a linear combination so as to make your collection improve.
I'll stop there - ask more questions if anything is unclear.