It would depend on many things. I am assuming you have a task that requires you to implement the sort by yourself.
- The size of the linked list. Insertionsort fares well with linked lists of moderate size. Otherwise quicksort should do the trick.
- The distributions of "word_count" which I am assuming you are sorting on.
- The requirements for your task. Is standard sorting i.e. std::sort acceptable?
For the problem I am reading between the lines a std::map pair< word_count, word> > would be the c++ way to go.
Or quite possibly an insertion sort if this is a school project, and you have not still covered Quicksort.
The most relevant response to your question is "What have you tried?", this is not an easy task. You have both the linked list concepts as well as the sorting concepts to sort out and get a hang of.