Representation of numeric data Range, precision, and rounding errors Arrays Representation of character data Strings and string processing
Amortized analysis Online and offline algorithms Randomized algorithms Dynamic programming Combinatorial optimization
The included code and solution write-up provides a parallel solution for the bounded knapsack problem, as described in the included problem description text file.
Follow these steps to allow for searching Intel Parallel Studio documentation
For more complete information about compiler optimizations, see our Optimization Notice.