Session

Computer Science and Information Systems

Description

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.

Keywords:

3SUM, Concurrent 3SUM, Algorithm, Concurrent Approach

Session Chair

Zhilbert Tafa

Session Co-Chair

Arjeta Vokshi

Proceedings Editor

Edmond Hajrizi

ISBN

978-9951-437-31-8

First Page

84

Last Page

86

Location

Durres, Albania

Start Date

7-11-2014 5:15 PM

End Date

7-11-2014 5:30 PM

DOI

10.33107/ubt-ic.2014.61

Download

Share

COinS
 
Nov 7th, 5:15 PM Nov 7th, 5:30 PM

Efficient Algorithm for solving 3SUM problem

Durres, Albania

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.