The Bean Counters

From CDOT Wiki
Revision as of 07:29, 7 April 2018 by Victoriouswaffles (talk | contribs) (→‎Source Code)
Jump to: navigation, search


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

BubbleS.png

selection sort

SelectionS.png

insertion sort

InsertionS1.png InsertionS2.png

merge sort

MergeS.png

heap sort

HeapS.png

quick sort

QuickS.png

counting sort

CountingS.png

radix sort

RadixS.png

bucket sort

BucketS.png

shell sort

ShellS.png

files

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

Results

Flat Profile

TBC a1Flat1.png

Call Graph

TBC a1Call1.png

Clustered Column Chart

Desktop Screenshot 2018.04.02 - 17.14.57.19 - Copy (2).png



A2: Parallelize

Source Code

bubble sort

Bubble-a3.png

selection sort

Selection-a2.png

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

Retrieved from "https://wiki.cdot.senecapolytechnic.ca/w/index.php?title=The_Bean_Counters&oldid=133029"