The Merge Sort Algorithm Is a Perfect Fit for Concurrency

Goroutine compared to threads are greater, more lightweight. So there shouldn't be like any real reason for concurrent application to be slower than sequential application. I took here as a concrete example the merge sort algorithm. And actually this parallel version is about 10 times slower than the sequenced version. Despite the fact that the parallel version leverages multiple cores,. so it's more than 10 times slower.

Play episode from 17:00

Transcript

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!

Get the app