Parallel merge sort
by Richard Cole
Parallel merge sort explores the application of parallel processing to the classic merge sort algorithm. With a focus on algorithmic structure and coordinated computation, it is suited to readers studying computer science, programming, sorting methods, and parallel computing.
About This Book
Parallel merge sort is a computer science topic centered on sorting data through parallel computation.
This work focuses on merge sort in a parallel setting, where portions of the sorting process can be coordinated across multiple processing tasks.
It may interest readers exploring algorithms, programming, and the principles of parallel computing.
Reviews
No reviews yet. Be the first to review this book!