|
|
| (47 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | = The Bean Counters =
| |
| | | | |
| − | == Team Members ==
| |
| − | 1. [mailto:ytian38@myseneca.ca?/subject=GPU610 Yankai Tian]
| |
| − |
| |
| − | 2. [mailto:cansin@myseneca.ca?/subject=GPU610 Jay Ansin]
| |
| − |
| |
| − | [mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All]
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − | 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 =
| |
