Performance of Parallel Computing in Bubble Sort Algorithm

Rihartanto Rihartanto (State Polytechnic of Samarinda)
Arief Susanto (Muria Kudus University)
Ansar Rizal (State Polytechnic of Samarinda)

Indonesian Journal of Electrical Engineering and Computer Science
Vol 7, No 3: September 2017

The performance of an algorithm can be improved by using a parallel computing programming approach. In this study, the performance of bubble sort algorithm on various computer specifications has been applied. Experimental results have shown that parallel computing programming can save significant time performance by 61%-65% compared to serial computing programming.