I am working with this assignment of optimizing a radix sort code in C++ and I need to reduce the execution time, my code is working and it looks like this: void RadixSort::RadixSortNaive(std::vector<long> &Arr) { long Max_Value = findMax(Arr); int Max_Radix = 1; while (1) { if (Max_Radix >= Max_Value) break; Max_Radix = Max_Radix*radix_; } ..

#### Category : acceleration

first thing first, thank you so much for helping me with this problem. I am working on a ROS-C++ Project. Problem: i have a vector of positions (x, y, z) and a vector of time stamp with 10 times per second sampling(10Hz), from these two vector i need to output: A vector of velocities A ..

## Recent Comments