Difference between revisions of "The Bean Counters"
(→Results) |
|||
| Line 57: | Line 57: | ||
=== Results === | === Results === | ||
| + | ==== Flat Profile ==== | ||
| + | [[File:A1flat.png]] | ||
==== Call Graph ==== | ==== Call Graph ==== | ||
| − | + | [[File:A1call.png]] | |
==== Clustered Column Chart ==== | ==== Clustered Column Chart ==== | ||
| − | + | [[File:Desktop_Screenshot_2018.04.02_-_17.14.57.19.png]] | |
== A2: Parallelize == | == A2: Parallelize == | ||
Revision as of 09:20, 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
