divide_and_conquer
“divide and conquer – an approach to problem-solving where a task (e.g., sorting a collection of values) is divided into roughly equal-sized smaller tasks whose individual solutions can be used to solve the original, larger problem (e.g., merge sort). constexpr Functions (297)” (EMCppSfe 2021)
divide_and_conquer.txt · Last modified: 2024/05/01 04:25 by 127.0.0.1