Difference between revisions of "The Bean Counters"
Line 1: | Line 1: | ||
+ | {{GPU610/DPS915 Index | 20181}} | ||
+ | |||
= The Bean Counters = | = 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.'' | ''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.'' | ||
Line 8: | 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 == | ||
Line 13: | Line 17: | ||
2. '''sorting algorithms''' - [http://www.cprogramming.com/tutorial/computersciencetheory/sortcomp.html Alex Allain cprogramming.com], [https://www.toptal.com/developers/sorting-algorithms Animations] | 2. '''sorting algorithms''' - [http://www.cprogramming.com/tutorial/computersciencetheory/sortcomp.html Alex Allain cprogramming.com], [https://www.toptal.com/developers/sorting-algorithms Animations] | ||
+ | |||
+ | |||
=Progress= | =Progress= | ||
− | == | + | == Select and Assess == |
There wasn't a project source code for this. Everything was written by yours truly. | There wasn't a project source code for this. Everything was written by yours truly. | ||
+ | === Sorting Algorithms === | ||
We tested 10 sorting algorithms: | We tested 10 sorting algorithms: | ||
− | |||
==== bubble sort ==== | ==== bubble sort ==== | ||
Line 40: | Line 46: | ||
==== shell sort ==== | ==== shell sort ==== | ||
− | |||
− | == | + | |
+ | |||
+ | |||
+ | == Parallelize == | ||
==== bubble sort ==== | ==== bubble sort ==== | ||
Line 51: | Line 59: | ||
− | == | + | |
+ | |||
+ | == Optimize == | ||
==== bubble sort ==== | ==== bubble sort ==== |
Revision as of 12:51, 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
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.
Sorting Algorithms
We tested 10 sorting algorithms: