[[courses:cs211:winter2014:journals:deirdre:chapter2]]
Trace: • chapter7 • chapter2
Show page
AdminRecent ChangesSitemap

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
courses:cs211:winter2014:journals:deirdre:chapter2 [2014/01/22 04:02] – [Section 2.5 - A More Complex Data Structure: Priority Queues] tobindcourses:cs211:winter2014:journals:deirdre:chapter2 [2014/01/22 04:03] (current) – [Section 2.4 - A Survey of Common Running Times] tobind
Line 79: Line 79:
 There are cases where one encounters running times that are asymptotically smaller than linear. Since it takes linear time just to read the input, these situations tend to arise in a model of computation where the input can be "queried' indirectly rather than read completely and the goal is to minimize the amount of querying that must be done. Example, binary search algorithm -> running time of //O(log n)//.  There are cases where one encounters running times that are asymptotically smaller than linear. Since it takes linear time just to read the input, these situations tend to arise in a model of computation where the input can be "queried' indirectly rather than read completely and the goal is to minimize the amount of querying that must be done. Example, binary search algorithm -> running time of //O(log n)//. 
  
- +I give this section a 8.5.
- +
 ====== Section 2.5 - A More Complex Data Structure: Priority Queues ====== ====== Section 2.5 - A More Complex Data Structure: Priority Queues ======
 **The Problem** **The Problem**
courses/cs211/winter2014/journals/deirdre/chapter2.1390363331.txt.gz · Last modified: 2014/01/22 04:02 by tobind
Show pageOld revisions
Media ManagerBack to top
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0