Part 2 of week 4’s lectures delved into Sort algorithms. Sort is difficult in parallel programming because things get more complex when adding the following objectives: keeping the hardware busy  Limiting branch divergence Coalescing memory access Odd-Even Sort (brick sort), parallel version of bubble sort: Start with an array of elements comparing odds and evens with different polarity each iteration. The elements are swapped if they are out of order… Read More