Algorithms can be designed for multithreading yes. Divide and conquer algorithms, like this one, break the problem into independent chunks, and a map reduce on that work can force it to be done across multiple threads.

The real question is whether you gain anything from it. Creating a thread and sending data back and forth has a cost as well, and it's usually a pretty big one relative to the work being done.