Difference between revisions of "The Bean Counters"
| Line 26: | Line 26: | ||
The algorithms tested are: | The algorithms tested are: | ||
| − | # bubble sort | + | # bubble sort |
# selection sort | # selection sort | ||
# insertion sort | # insertion sort | ||
| Line 35: | Line 35: | ||
# radix sort | # radix sort | ||
# bucket sort | # bucket sort | ||
| − | # shell sort | + | # shell sort ==== |
Revision as of 13:59, 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 ====
