Skip to main content

CS201: Elementary Data Structures

Page path
  • Home /
  • Courses /
  • Course Catalog /
  • Computer Science /
  • CS201: Elementary Data Structures /
  • Unit 6: Algorithm Efficiency /
  • 6.2: Big-O Analysis
Back to 'Unit 6: Algorithm Efficiency'

  • 6.2: Big-O Analysis

    • Chemeketa Community College: "Big-O" Page

      Big-O analysis is a formal notation for discussing algorithm efficiency. This article introduces that notation.

Navigation

Art History
Biology
Business Administration
Chemistry
Communication
Economics
English
History
Mathematics

Creative Commons License
© Saylor Academy 2010-2018 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See www.saylor.org/open/licensinginformation for detailed licensing information.

Saylor Academy and Saylor.org® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Terms of Use | Privacy Policy