Difference between revisions of "The Bean Counters"
(→bubble sort) |
(→A3: Optimize) |
||
| Line 61: | Line 61: | ||
===== bubble sort ===== | ===== bubble sort ===== | ||
[[File:Bubble-a3.png]] | [[File:Bubble-a3.png]] | ||
| − | |||
===== selection sort ===== | ===== selection sort ===== | ||
| + | [[File:Selection-a2.png]] | ||
===== insertion sort ===== | ===== insertion sort ===== | ||
| + | Cant be parallelized. | ||
| + | ===== radix sort ===== | ||
---- | ---- | ||
| + | |||
=== Results === | === Results === | ||
==== Visual Profiler ==== | ==== Visual Profiler ==== | ||
| Line 76: | Line 79: | ||
=== Source Code === | === Source Code === | ||
===== bubble sort ===== | ===== bubble sort ===== | ||
| + | [[File:Bubble-a3.png]] | ||
===== selection sort ===== | ===== selection sort ===== | ||
| − | ===== | + | [[File:Selection-a3.png]] |
| + | ===== radix sort ===== | ||
---- | ---- | ||
=== Results === | === Results === | ||
Revision as of 07:27, 7 April 2018
GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary
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.
Contents
Team Members
Email All
Projects
- sudoku - by Tian Debebe (CMU) not affiliated with Yankai whatsoever
- sorting algorithms - Alex Allain cprogramming.com, Animations
Progress
A1: Select and Assess
There wasn't a project source code for this. Everything was written by yours truly. etc. etc. etc. The 10 algorithms tested are:
Source Code
bubble sort
selection sort
insertion sort
merge sort
heap sort
quick sort
counting sort
radix sort
bucket sort
shell sort
files
sort.h algorithms file, main.cpp (v1) file, main.cpp (v2) file, utilities.h file
Results
Flat Profile
Call Graph
Clustered Column Chart
.png)
A2: Parallelize
Source Code
bubble sort
selection sort
insertion sort
Cant be parallelized.
radix sort
Results
Visual Profiler
Parallel NSight
Comparison
A3: Optimize
Source Code
bubble sort
selection sort
