SLOG Entry #7

     Well here's another SLOG entry. Sorry for the wait. This week, in the world of computer science, we learned about performance and big oh. Performance basically asks how efficient is a certain function for this task. In our case, it was which sorts take less time. Depending on the type of tests the function is going to be called on, examples being best-case-scenario and worst-case-scenario, each function has a different algorithm that shows it's processing time. These alogriths can be represented by big-oh, or O(y) for y being the complexity of the algorithm. This is useful, as we can compare effeciencies of different functions by comparing different O's. By testing the performance of our sorts, we saw that several were far more effecient then others in the worst-case-scenario. This seems like a useful skill that will be helpful for far larger and more complicated programs, for which a fast performance is vital. That's all for this week.