- import java.util.concurrent.*;
- 2. class Sum {
- 3. int low, high;
- 4. int[] array;
- 5. Sum(int[] arr, int lo, int hi) {
- 6. array = arr;
- 7. low = lo;
- 8. high = hi;
- 9. }
- 10. protected Long process() {
- 11. if(high - low <= 4) {
- 12. long sum = 0;
- 13. for(int i=low; i < high; ++i)
- 14. sum += array[i];
- 15. return sum;
- 16. } else {
- 17. int mid = low + (high - low) / 2;
- 18. Sum left = new Sum(array, low, mid);
- 19. Sum right = new Sum(array, mid, high);
- 20. left.fork();
- 21. long rightAns = right.process();
- 22. long leftAns = left.join();
- 23. return leftAns + rightAns;
- 24. }
- 25. }
- 26. static long sumArray(int[] array) {
- 27. return new ForkJoin().invoke(new Sum(array,0,array.length));
- 28. }
- 29. }
[text] fhcghkhfgsdh
Viewer
*** This page was generated with the meta tag "noindex, nofollow". This happened because you selected this option before saving or the system detected it as spam. This means that this page will never get into the search engines and the search bot will not crawl it. There is nothing to worry about, you can still share it with anyone.
Editor
You can edit this paste and save as new:
File Description
- fhcghkhfgsdh
- Paste Code
- 23 Mar-2023
- 966 Bytes
You can Share it:
Latest Code Pastes