Today in class students will present the sorting algorithms they originally selected as they are written in SORT.H.

Sorting Algorithms
Sort	Presenters	Sort	Presenters
Bubble Sort	Abi (1A) / Noah (3B)	Merge Sort	Alex (1A) / Conrad (3B)
Insertion Sort	Rockwell (1A) / Gabe (3B)	Quick Sort	Gabriel (1A) / Toby (3B)
Selection Sort	Eleanor (1A) / Anupama (3B)	Radix Sort	Nikita (1A) / Donovan (3B)
Heap Sort	Sean (1A) / Blu (3B)	Tree Sort	Jeff (1A) / Dylan and Alessandra (3B)

These presentations will be evaluated using the rubric shared last week.