|
|
| (40 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | = 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. [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]
| |
| − |
| |
| − | == Projects ==
| |
| − | 1. sudoku - [http://www.andrew.cmu.edu/user/astian/ by Tian Debebe (CMU)] ''not affiliated with Yankai whatsoever''
| |
| − |
| |
| − | 2. '''sorting algorithms''' - [http://www.cprogramming.com/tutorial/computersciencetheory/sortcomp.html Alex Allain cprogramming.com], [https://www.toptal.com/developers/sorting-algorithms 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:
| |
| − |
| |
| − | ==== bubble sort ====
| |
| − |
| |
| − | ==== selection sort ====
| |
| − |
| |
| − | ==== insertion sort ====
| |
| − |
| |
| − | ==== merge sort ====
| |
| − |
| |
| − | ==== heap sort ====
| |
| − |
| |
| − | ==== quick sort ====
| |
| − |
| |
| − | ==== counting sort ====
| |
| − |
| |
| − | ==== radix sort ====
| |
| − |
| |
| − | ==== bucket sort ====
| |
| − |
| |
| − | ==== shell sort ====
| |
| − |
| |
| − |
| |
| − | == Assignment 2 - Parallelize ==
| |
| − |
| |
| − | ==== bubble sort ====
| |
| − |
| |
| − | ==== selection sort ====
| |
| − |
| |
| − | ==== insertion sort ====
| |
| − |
| |
| − |
| |
| − | == Assignment 3 - Optimize ==
| |
| − |
| |
| − | ==== bubble sort ====
| |
| − |
| |
| − | ==== selection sort ====
| |
| − |
| |
| − | ==== insertion sort ====
| |
