You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Usually you can use this techinique when you can do a single query in $O(n \cdot log_2(MaxAns))$, you can sweep through the array and prosess all the queries in a parallel way, So usually the total complexity is: $O((n + q) \cdot log_2(MaxAns))$
@bqi343 I have added the first draft of parallel binary search module. If you can check it out and let me know where I fell short and maybe you can fix some issues
This should be probably in Gold or Platinium.
Usually you can use this techinique when you can do a single query in$O(n \cdot log_2(MaxAns))$ , you can sweep through the array and prosess all the queries in a parallel way, So usually the total complexity is: $O((n + q) \cdot log_2(MaxAns))$
Problems:
Probably also add problem SZKOpul - Meteors, but I'm not sure about it.
The text was updated successfully, but these errors were encountered: