Open AccessEfficient Algorithm for solving 3SUM problem
Author(s) -
Muhamed Retkoceri
Publication year - 2015
Publication title -
international journal of business and technology
Language(s) - English
Resource type - Journals
ISSN - 2223-8387
DOI - 10.33107/ijbte.2015.3.2.02
Subject(s) - computer science , algorithm , sorting , sorting algorithm , task (project management) , computation , running time , ramer–douglas–peucker algorithm , management , economics
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.