Changes

=== Algorithms (Joseph Pildush)===

My topic is about Algorithms and the stress on the CPU of running them with large sizes of arrays. When using most algorithms with a set of arrays of a small size, the algorithms tend to finish faster then a second. When using these algorithms with larger sized arrays, based on my results it can be seen that the stress continues to increase as the size of the arrays increase, which in turn would also increase the execution time of the algorithms. In a situation when these algorithms are being called multiple times on large sized arrays, there would be an immense increase in execution time which may also result in the program becoming overall slow and/or hanging.

Algorithms Used: std::sort, saxpy, prefix-sum

<br>

==== Results ====

<source>

|# of Elements | std::sort | saxpy | prefix-sum |

| 1,000,000 | 66 | 4 | 75 |

| 10,000,000 | 742 | 36 | 584 |

| 50,000,000 | 3983 | 189 | 2343 |

| 100,000,000 | 8393 | 378 | 4649 |

</source>

==== Graph ====

[[File:AlgorithmGraph.png]]

0.00 17.52 0.00 1 0.00 0.00 void std::__insertion_sort<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__ops::_Iter_less_iter>(__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__ops::_Iter_less_iter)

</source>

=== Assignment 2 ===