| Key Words |
Sorting without moves; parallel sorting; Bubble sort; Insertion sort; Quick sort. |
| Abstract |
This paper examines one algorithm for sorting a row without moves by counting. It is proposed a modification of this algorithm, which decreases the number of increments. The modification is named SWM. On the base of SWM it is proposed a parallel algorithm for sorting rows. The SWM algorithm is compared to Bubble sort, Insertion sort, Selection sort and Quick sort algorithms. The results show that proposed algorithm is faster than Bubble sort, Insertion sort and Selection sort but slower than Quick sort. |
| Article PDF | Download article (PDF) |
