The Bean Counters

From CDOT Wiki
Jump to: navigation, search


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

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

  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

BubbleSort.png

selection sort

SelectionSort1.png

insertion sort

InsertionSort.png

InsertionSort2.png

merge sort

MergeSort.png

heap sort

HeapSort.png

quick sort

QuickSort.png

counting sort

CountingSort.png

radix sort

RadixSort.png

bucket sort

BucketSort.png

shell sort

ShellSort.png

Results

Call Graph

Clustered Column Chart

A2: Parallelize

Source Code

bubble sort
selection sort
insertion 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=132898"