WDI Day Fifty-One: Computer Science

Today was a bit of a crash-course in computer science. We reviewed a handful of over-arching topics involved with data and sorting, including Big-O notation. Big-O notation is a way of comparing the efficiency of algorithms. We read over a pretty useful blog post on Big-O notation and  did a few exercises involving different types of sorting, such as quicksort.


Leave a Reply