向特定对象发行股份及支付现金购买.pptVIP

CISC220Spring 2010James Atlas Lecture 06: Linked Lists (2), Big O Notation Objectives for Today Introduce Big-O notation Reading - K+W Chap 4.1-4.5, 2.6 Collection add(x) remove(x) member(x) size() first() Single Linked List Class Exercise Implement add, member, first Efficiency of Algorithms An operation for our ADT can be thought of as a “problem” An algorithm solves the “problem” A series of steps Each step has a cost Time Space Efficiency is a measurement of this cost Example 2.14/2.16 Big-O notation Describes the relationship between input size and execution time If we double th