Remove repeated words from a 2D character array
Your algorithm is \$O(n^2)\$.  You can reduce this to \$O(n)\$ by first inserting them into a closed hash table (i.e., one with bucket chains).
I'd optimise is rather than copying the whole items, just copy pointers to the original strings (unless you intend to alter their contents later on).