In this tutorial, we will look at how to solve the prefix sum puzzle in Java with SIMD operations and reduce linear big O complexity down to one that is logarithmic. A previous post described how to ...