SORTING ALGORITHMS WITH CUDA!

Summary from the TLDR Web Dev newsletter

This developer looked into optimizing merge sort with CUDA to use parallel computing. A basic recursive merge sort was implemented on both CPU and GPU, at which CUDA was too slow comparatively. An iterative bottom-up merge sort was then implemented in CUDA, parallelizing merge operations and showing performance improvements compared to the recursive CUDA approach, coming close to `thrust::sort` on large arrays.