Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2018:journals:patelk:chapter5 [2018/03/10 20:25] – [5.3 Counting Inversions] patelk
+++ courses:cs211:winter2018:journals:patelk:chapter5 [2018/03/10 20:28] (current) – [5.3 Counting Inversions] patelk
@@ Line 135: / Line 135: @@
 {{:courses:cs211:winter2018:journals:patelk:merge-and-sort2.png?nolink&400|}}
+  * The Sort-And-Count algorithm correctly sorts the input list and counts the number of inversions in O(nlogn) running time for a list with n elements
+==== Personal Thoughts ====
+I thought this section provided a very interesting algorithm to count the number of inversions in O(nlogn) time. The combination of this section and the classroom discussion did a pretty good job of helping me understand this material. It also helped that we were introduced to inversions in another chapter/section. This made it so that the concept as a whole wasn't as difficult to understand. The algorithm and runtime both make sense to me.
+Readability: 7.0
+Interesting: 7.0