Difference between revisions of "The Bean Counters"
| Line 44: | Line 44: | ||
== Assignment 2 - Parallelize == | == Assignment 2 - Parallelize == | ||
| + | ==== bubble sort ==== | ||
| + | ==== selection sort ==== | ||
| + | |||
| + | ==== insertion sort ==== | ||
== Assignment 3 - Optimize == | == Assignment 3 - Optimize == | ||
| + | |||
| + | ==== bubble sort ==== | ||
| + | |||
| + | ==== selection sort ==== | ||
| + | |||
| + | ==== insertion sort ==== | ||
Revision as of 13:47, 2 April 2018
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
Assignment 1 - Select and Assess
There wasn't a project source code for this. Everything was written by yours truly.
We tested 10 sorting algorithms:
