Differences

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

--- courses:cs211:winter2011:journals:charles:home [2011/01/26 06:52] – gouldc
+++ courses:cs211:winter2011:journals:charles:home [2011/01/27 06:58] – gouldc
@@ Line 1: / Line 1: @@
 ====== Charles' Journal ======
+  * [[chapter1|Chapter 1: Introduction]]
+  * [[chapter2|Chapter 2: Algorithm Analysis]]
 PREFACE
@@ Line 63: / Line 67: @@
 .5 A More Complex Data Structure: Priority Queues
-A priority queue is a data structure designed to store elements with priority values. A priority queue has the ability to add, delete, and select elements. When a priority queue is asked to "select" an element, it returns the element with the highest priority. This characteristic of priority queues is applicable to problems such as the scheduling of processes on a computer. (Weighted interval scheduling comes to mind; see 1.2)
+A priority queue is a data structure designed to store elements with priority values. It can add, delete, and select elements. When a priority queue is asked to "select" an element, it returns the element with the highest priority. This characteristic of priority queues is applicable to problems such as the scheduling of processes on a computer. (Weighted interval scheduling comes to mind; see 1.2)