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

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

3. Insertion Sort

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

5. Insertion Sort
Pseudocode:

6. Insertion Sort
Example:

7. Selection Sort

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

9. Selection Sort
Pseudocode:

10. Selection Sort
Example:

11. Sorting Algorithm ARM Demo

12. QUESTIONS

13. References http://en.wikipedia.org/wiki/Insertion_sort