Parallel Binary Search
January 20, 2017
So what Parallel Binary Search does is move one step down in N binary search trees simultaneously in one “sweep”, taking O(N * X) time, where X is dependent on the problem and the data structures used in it.
January 20, 2017
So what Parallel Binary Search does is move one step down in N binary search trees simultaneously in one “sweep”, taking O(N * X) time, where X is dependent on the problem and the data structures used in it.