Merge Sort and Divide and Conquer

This week we primarily covered merge sort because we had a mid term to study for. Merge sort is a classic example of an algorithm that leverages the divide and conquer technique. Merge sort improves upon the classic bubble sort by reducing Time complexity from O(n^2) to O(n log n) which is a massive improvement with substantially large data sets.

This is also why binary search trees are much more efficient than a simple linear search. If you can order your list in a binary tree you can make searching your list much faster by reducing time complexity to O (log n) rather than O (n).

Anyways, other than that I missed a bunch of questions on the exam which is a bummer. I'll just have to study a lot more for the final.