Difference between revisions of "The Bean Counters"
(→The Bean Counters) |
|||
| Line 1: | Line 1: | ||
| − | + | = The Bean Counters = | |
== Team Members == | == Team Members == | ||
| Line 12: | Line 12: | ||
| + | sorting algorithms - [http://www.cprogramming.com/tutorial/computersciencetheory/sortcomp.html Alex Allain cprogramming.com], [https://www.toptal.com/developers/sorting-algorithms Animations] | ||
| + | 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. | ||
| − | |||
| − | |||
| − | + | = Assignment 1 - Select and Assess = | |
| − | + | = Assignment 2 - Parallelize = | |
| − | + | = Assignment 3 - Optimize = | |
Revision as of 13:30, 2 April 2018
Contents
The Bean Counters
Team Members
1. Yankai Tian
2. Jay Ansin
sorting algorithms - Alex Allain cprogramming.com, Animations
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.
