我正在为他们的并行编程课程进行Udacity测验.我非常坚持我应该如何开始作业,因为我不确定我是否正确理解它.
对于赋值(在代码中),我们在值和位置数组上给出了两个数组和数组.我们应该使用并行基数排序对值数组进行排序,同时也正确设置位置.
我完全理解基数排序及其工作原理.我不明白的是他们希望我们如何实施它.这是开始分配的模板
//Udacity HW 4
//Radix Sorting
#include "reference_calc.cpp"
#include "utils.h"
/* Red Eye Removal
===============
For this assignment we are implementing red eye removal. This is
accomplished by first creating a score for every pixel that tells us how
likely it is to be a red eye pixel. We have already done this for you - you
are receiving the scores and need to sort them in ascending order so that we
know which pixels to alter to …