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 ...

Sorting. It’s a classic problem that’s been studied for decades, and it’s a great first step towards “thinking algorithmically.” Over the years, a handful of sorting algorithms have emerged, each ...

When you’re trying to learn how an algorithm works, it’s not always easy to visualize what’s going on. Well, except for maybe binary sort, thanks to the phone book. Professor [thatguyer] is a computer ...

A formula used to reorder data into a new sequence. Like all complicated problems, there are many solutions that can achieve the same results, and one sort algorithm can re-sequence data faster than ...

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Computer scientists often ...

It was previously thought that children younger than 7 couldn't find efficient solutions to complex problems, but new ...