3SUM, Concurrent 3SUM, Algorithm, Concurrent Approach
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.
"Efficient Algorithm for solving 3SUM problem,"
International Journal of Business and Technology: Vol. 3:
2, Article 2.
Available at: https://knowledgecenter.ubt-uni.net/ijbte/vol3/iss2/2