COM S 211 COMPUTERS AND PROGRAMMING Cornell

Binary search runs in O(log n) time. Michael George Tuesday March 29, 2005 This is a proof that binary search runs in O(log n) time. Here is the code: binsearch (A, x, a, b) if b = a then return false b-a m 2 +a if A[m] > x then return binsearch (A,

Threads and Concurrency Announcements ACSU final general meeting of the year Wed 4/25, 5pm, Upson Lounge (117) Speaker: Gun Sirer on P2P networks Free food! Online course evaluations are available from now until next Monday noon please visit

Balanced Search Trees Prelim tonight! Lecture 22 CS211 Spring 2007 Some Search Structures Sorted Arrays Advantages Search in O(log n) time (binary search) Balanced Search Trees Best of both! Search, insert, delete in O(log n) time No need to

More Graphs Lecture 21 CS211 Spring 2007 Representations of Graphs 1 2 4 3 Adjacency List 1 2 2 3 4 Adjacency Matrix 1 1 2 0 0 0 0 2 1 0 0 1 3 0 1 0 1 4 1 0 0 0 3 4 2 3 3 4 Adjacency Matrix or Adjacency List? n = number of vertices m = number

Binary search runs in O(log n) time. Michael George Tuesday March 29, 2005 This is a proof that binary search runs in O(log n) time. Here is the code: binsearch (A, x, a, b) if b = a then return false b-a m 2 +a if A[m] > x then return binsearch (A,

Announcements Iteration i < a.length; i+) { if (a[i].compareTo(v) = 0) return true; } return fal

The Bag Interface Priority Queues and Heaps interface Bag<E> { void put(E obj); E get(); /extract some element boolean isEmpty(); } Lecture 16 CS211 Spring 2007 Examples: Stack, Queue Stacks and Queues as Lists Stack (LIFO) implemented as list p

GUI Statics and GUI Dynamics GUI Dynamics Statics: whats drawn on the screen Components buttons, labels, lists, sliders, menus, . Dynamics: user interactions Events button-press, mouse-click, keypress, . Containers: components that contain other co

Prelim 2 Reminder Prelim 2 Prelim 2 Review Session Sunday 4/15,1:30-3:00pm Kimball B11 Individual appointments are available if you cannot attend the review session (email one TA to arrange appointment) Graphs Tuesday, April 17, 7:30-9pm Uris Audit