Differences

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

--- courses:cs211:winter2018:journals:patelk:chapter2 [2018/01/28 20:15] – [2.5 A More Complex Data Structure: Priority Queues] patelk
+++ courses:cs211:winter2018:journals:patelk:chapter2 [2018/01/28 20:18] (current) – [2.5 A More Complex Data Structure: Priority Queues] patelk
@@ Line 255: / Line 255: @@
   * __Delete(H,i):__ deletes element in position i -> **O(logn)**
   * __ExtractMin(H):__ identifies and deletes minimum key element -> **O(logn)**
+----
+==== Personal Thoughts ====
+This section was pretty straightforward and easy to follow. I think going over the concepts in class before reading this section of the textbook was helpful in clarifying things that maybe would have been otherwise confusing. I appreciated the summary of the operation run times as these can sometimes be difficult to recall.
+Readability: 9
+Interesting: 6