Difference between revisions of "The Bean Counters"
| Line 5: | Line 5: | ||
== Team Members == | == Team Members == | ||
| − | + | # [mailto:ytian38@myseneca.ca?/subject=GPU610 Yankai Tian] | |
| − | + | # [mailto:cansin@myseneca.ca?/subject=GPU610 Jay Ansin] | |
| − | |||
[mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All] | [mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All] | ||
| Line 14: | Line 13: | ||
== Projects == | == Projects == | ||
| − | + | # sudoku - [http://www.andrew.cmu.edu/user/astian/ by Tian Debebe (CMU)] ''not affiliated with Yankai whatsoever'' | |
| − | + | # '''sorting algorithms''' - [http://www.cprogramming.com/tutorial/computersciencetheory/sortcomp.html Alex Allain cprogramming.com], [https://www.toptal.com/developers/sorting-algorithms Animations] | |
| − | |||
| Line 25: | Line 23: | ||
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. | ||
| − | + | === Sorting Algorithms === | |
| − | + | The algorithms tested are: | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | + | # bubble sort | |
| + | # selection sort | ||
| + | # insertion sort | ||
| + | # merge sort | ||
| + | # heap sort | ||
| + | # quick sort | ||
| + | # counting sort | ||
| + | # radix sort | ||
| + | # bucket sort | ||
| + | # shell sort | ||
Revision as of 13:56, 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
Projects
- sudoku - by Tian Debebe (CMU) not affiliated with Yankai whatsoever
- 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.
Sorting Algorithms
The algorithms tested are:
- bubble sort
- selection sort
- insertion sort
- merge sort
- heap sort
- quick sort
- counting sort
- radix sort
- bucket sort
- shell sort
