[mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All] 

There wasn't a project source code for this. Everything was written by yours truly. etc. etc. etc. ==== Sorting Algorithms ====The 10 algorithms tested are: ===== bubble sort ===== template<typename T> inline void bubbleSort(T * array, int size) { for (int i = 0; i < size; i++) { for (int j = 0; j < size - 1; j++) { if (array[j] > array[j + 1]) { T swap = array[j + 1]; array[j + 1] = array[j]; array[j] = swap; } } } } ===== selection sort ===== template<typename T> inline void selectionSort(T * array, int size) { for (int i = 0; i < size; i++) { int min = i; for (int j = i; j < size; j++) { if (array[min] > array[j]) min = j; } T temp = array[i]; array[i] = array[min]; array[min] = temp; } } ===== insertion sort =====  ===== merge sort =====  ===== heap sort =====  ===== quick sort =====  ===== counting sort =====  ===== radix sort =====  ===== bucket sort =====

# bubble sort # selection sort # insertion sort# merge sort# heap sort# quick sort# counting sort# radix sort# bucket sort# ===== shell sort =====

===== bubble sort =====

===== selection sort =====

===== insertion sort =====

===== bubble sort =====

===== selection sort =====

===== insertion sort =====