In this article, we present the bubble sort and merge sort algorithms. We discuss the cycle counts of these algorithms on the Blackfin processor, and show how to reduce the cycle count of the bubble ...

Refactor #1: The classic bubble sort, with a functional twist The original Sort application show below is far from functional.

On the site you can visualize and compare a whole bunch of algorithms, from common implementations like Quick Sort and Bubble Sort, to more quirky examples like Cocktail Sort and Gnome Sort (really).

[Anthony] readily admits the bubble sort is very inefficient at this task; it was an intentional choice so it could be later compared with other sorting methods.

GPU-based sorting algorithms have emerged as a crucial area of research due to their ability to harness the immense parallel processing power inherent in modern graphics processing units. By ...

If you ever need to sort character strings stored in SQL Server fields, check out this demonstration of how to write a common sorting algorithm using SQL Server TSQL code.