Sorting Algorithms: Implemented using ARM Assembly Thomas Clark, Charlie Phipps, Samir Thakral

Outline Insertion Sort Selection Sort Pseudocode How it Works Selection Sort Sorting Algorithms ARM Demonstration

Insertion Sort

Insertion Sort How it works: Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

Insertion Sort Pseudocode:

Insertion Sort Example:

Selection Sort

Selection Sort How it works: The program essentially splits the input array into two parts: the sublist of elements already sorted, which is built from the left to the right of the list, and remaining elements that need to be sorted. Each iteration of the program find the minimum element left from the unsorted elements and puts it at the end of the sorted list of elements.

Selection Sort Pseudocode:

Selection Sort Example:

Sorting Algorithm ARM Demo

QUESTIONS

References http://en.wikipedia.org/wiki/Insertion_sort http://en.wikipedia.org/wiki/Selection_sort http://armsim.cs.uvic.ca/AttachedFiles/ARMSim_UserGuide4Plus.pdf