判断题:When we solve the ranking problem via designing the parallel
When we solve the ranking problem via designing the parallel algorithms based on binary search, we shorten the worst-case running time but take more work loads comparing with the sequential algorithms.
答案:TRUE
答案:TRUE