•  
  •  
 

Keywords

3SUM, Concurrent 3SUM, Algorithm, Concurrent Approach

Abstract

In this paper is presented an algorithm for solving 3SUM problem efficiently in general computation model. The algorithm is based on sorting and splits the task into sub-tasks where this approach enables the algorithm to run concurrently at the high-level of computing. The algorithm is O(n2) and running sequentially achieves at least ~1/5 n2 number of basic necessary accesses of data structures. In this paper is also presented a comparison of running performances in practice between the new algorithm and the current most famous algorithm for 3SUM which is in-place and also based on sorting.

First Page

13

Last Page

15

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.