The Bean Counters

GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary

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

1. Yankai Tian
2. Jay Ansin

 Email All

Projects

1. sudoku - by Tian Debebe (CMU) not affiliated with Yankai whatsoever
2. 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

files

sort.h algorithms file, main.cpp (v1) file, main.cpp (v2) file, utilities.h file

---

Results

Flat Profile

Call Graph

Clustered Column Chart

A2: Parallelize

Source Code

bubble sort

selection sort

insertion sort

Cant be parallelized.

radix sort

---

Results

Visual Profiler

Parallel NSight

Comparison

A3: Optimize

Source Code

bubble sort

selection sort

insertion sort

---

Results

Visual Profiler

Parallel NSight

Comparison