Sorting Algorithms // SPIN or PASM

Warning message

The Propeller Object Exchange system is decommissioned and replaced with a GitHub repository to house the same existing and future Propeller objects. As of 12/5/2019, this site is read-only. You can continue to browse and download objects from here for a limited time; however, please begin using the Parallax Propeller repository for future reference.
  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0
Request group membership
By: created: 2011-02-11 | updated: 2013-05-02


Sorting Algorithms

This is a collection of sorting algorithms for both string and decimal sorting. In each file there is a demo that demonstrates each algorithm's speed.

Algorithms include bubble sort, cocktail sort, insertion sort, shell sort, and quick sort.

Only insertion sort, shell sort, and quick sort should be considered for use in any program, but the other two are included for educational purposes.

To use: Decide which algorithm you want to use, then copy-paste that into the object you are using. Note that the Quick Sort also requires the Insertion Sort method. And the PASM Shell Sort requires the applicable DAT section. The other sort methods are self-contained (no CONs, VARs, OBJs, or DATs needed)


Version 1.02:
  * Added PASM version of Shell Sort. This is up to 66 times faster than the SPIN variety.
Original File Upload
Package icon SortingAlgorithms102.zip16.95 KB