The Bean Counters

From CDOT Wiki
Jump to: navigation, search


GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary

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

Email All


Projects

  1. sudoku - by Tian Debebe (CMU) not affiliated with Yankai whatsoever
  2. 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:

  1. bubble sort
  2. selection sort
  3. insertion sort
  4. merge sort
  5. heap sort
  6. quick sort
  7. counting sort
  8. radix sort
  9. bucket sort
  10. shell sort



Parallelize

bubble sort

selection sort

insertion sort

Optimize

bubble sort

selection sort

insertion sort