KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I want to implement the parallel prefix sum algorithm using C++. My program should take the input array x[1....N] ,and it should display the output in the array y[N] . (Note the maximum value of N is 1000.) So far, I went through many research papers and even the algorithm in Wikipedia. But my program should also display the output, the steps and also the operations/instructions of each step. I want the fastest implementation like I want to minimise the number of operations as well as the steps. For example:: x = {1, 2, 3, 4, 5, 6, 7, 8 } - Input y = ( 1, 3, 6, 10, 15, 21, 28, 36) - Output But along with displaying the y array as output, my program should also display the operations of each step. I also refer this thread calculate prefix sum ,but could get much help from it.
Tags (comma-separated)
Save Edits
Cancel