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

In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

For decades, the computing industry relied on Moore’s law: as transistors became ever smaller, the number that could be crammed onto a computer chip seemed to double every two years, enabling a ...