What We Do

The above graph compares performance of several different sorting algorithms implemented in C++. X-axis is the array size being sorted. Y-axis is the time in seconds it took to sort the array. The faster the algorithm, the less time it takes to sort. The above graph is for arrays filled with uniformly distributed random unsigned 32-bit integers.


2019/9/30 Updated consulting details on the about page.
2018/7/6 Introducing the lab.
2017/5/17 The website is up!
home store lab about