Difference between revisions of "The Bean Counters"
| 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 == | ||
| Line 17: | Line 15: | ||
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= | ||
| Line 25: | Line 21: | ||
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. | ||
| − | |||
We tested 10 sorting algorithms: | We tested 10 sorting algorithms: | ||
| + | |||
==== bubble sort ==== | ==== bubble sort ==== | ||
| Line 46: | Line 42: | ||
==== shell sort ==== | ==== shell sort ==== | ||
| − | + | ||
| − | |||
| − | |||
== Parallelize == | == Parallelize == | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
== Optimize == | == Optimize == | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 13:52, 2 April 2018
GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary
Contents
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.
We tested 10 sorting algorithms:
