Difference between revisions of "The Bean Counters"
| Line 25: | Line 25: | ||
===== bubble sort ===== | ===== bubble sort ===== | ||
[[File:BubbleSort.png]] | [[File:BubbleSort.png]] | ||
| + | |||
===== selection sort ===== | ===== selection sort ===== | ||
[[File:SelectionSort1.png]] | [[File:SelectionSort1.png]] | ||
| + | |||
===== insertion sort ===== | ===== insertion sort ===== | ||
[[File:InsertionSort.png]] | [[File:InsertionSort.png]] | ||
[[File:InsertionSort2.png]] | [[File:InsertionSort2.png]] | ||
| + | |||
===== merge sort ===== | ===== merge sort ===== | ||
[[File:MergeSort.png]] | [[File:MergeSort.png]] | ||
| + | |||
===== heap sort ===== | ===== heap sort ===== | ||
[[File:HeapSort.png]] | [[File:HeapSort.png]] | ||
| + | |||
===== quick sort ===== | ===== quick sort ===== | ||
[[File:QuickSort.png]] | [[File:QuickSort.png]] | ||
| + | |||
===== counting sort ===== | ===== counting sort ===== | ||
[[File:CountingSort.png]] | [[File:CountingSort.png]] | ||
| + | |||
===== radix sort ===== | ===== radix sort ===== | ||
[[File:RadixSort.png]] | [[File:RadixSort.png]] | ||
| + | |||
===== bucket sort ===== | ===== bucket sort ===== | ||
[[File:BucketSort.png]] | [[File:BucketSort.png]] | ||
| + | |||
===== shell sort ===== | ===== shell sort ===== | ||
[[File:ShellSort.png]] | [[File:ShellSort.png]] | ||
| Line 49: | Line 58: | ||
==== Flat Profile ==== | ==== Flat Profile ==== | ||
| − | [[File: | + | [[File:A1.flat]] |
| + | |||
==== Call Graph ==== | ==== Call Graph ==== | ||
| − | [[File:A1.call. | + | [[File:A1.call.pgn]] |
| + | |||
==== Clustered Column Chart ==== | ==== Clustered Column Chart ==== | ||
| − | [[File:Desktop_Screenshot_2018.04.02_-_17.14.57. | + | [[File:Desktop_Screenshot_2018.04.02_-_17.14.57.19.png]] |
== A2: Parallelize == | == A2: Parallelize == | ||
Revision as of 09:26, 5 April 2018
GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary
Contents
The Bean Counters
Beans are a cheap commodity, so to count them is a rather silly thing to do. A "bean counter" is one who nitpicks over small things in order to save costs.
Team Members
Email All
Projects
- sudoku - by Tian Debebe (CMU) not affiliated with Yankai whatsoever
- sorting algorithms - Alex Allain cprogramming.com, Animations
Progress
A1: Select and Assess
There wasn't a project source code for this. Everything was written by yours truly. etc. etc. etc. The 10 algorithms tested are:
Source Code
bubble sort
selection sort
insertion sort
merge sort
heap sort
quick sort
counting sort
radix sort
bucket sort
shell sort
Results
Flat Profile
Call Graph
Clustered Column Chart
