Difference between revisions of "The Bean Counters"

From CDOT Wiki
Jump to: navigation, search
Line 10: Line 10:
  
 
[mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All]
 
[mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All]
 +
 +
  
 
== Projects ==
 
== Projects ==

Revision as of 12:53, 2 April 2018


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

Select and Assess

There wasn't a project source code for this. Everything was written by yours truly.

We tested 10 sorting algorithms:

bubble sort

selection sort

insertion sort

merge sort

heap sort

quick sort

counting sort

radix sort

bucket sort

shell sort

Parallelize

bubble sort

selection sort

insertion sort

Optimize

bubble sort

selection sort

insertion sort