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

Usually, we specify the complexity of an algorithm using the notation O (.), which indicate 'the order of'. For example, the complexity of sorting N numbers using the bubble sort method is O (N2) and ...

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

The odd-even merge sort algorithm was developed by K.E. Batcher. It takes two sorted array and merge them into a single sorted array.

Anyone who has taken a basic computer science class has undoubtedly spent time devising a sorting algorithm—code that will take an unordered list of items and put them in ascending or descending ...