PocketSort demonstrates how five classic sorting algorithms work. It randomizes and then sorts colored bars according to Bubble, Shell, Heap, Merge, and Quick sorting approaches. Sample code in java, javascript, and ruby is implemented and viewable for each algorithm. Program code is syntax-highlighted for readers convenience. Single- and double-tap gestures enable students of these algorithms to pause/restart the sorting process, and thus visually observe intermediate effects of the algorithms.