Computing and Information Technology Interactive Digital Educational Library


Computing Course Materials >
Fundamentals of Algorithms >

Please use this identifier to cite or link to this item:

Title: Asymptotic Notations
Authors: Choueiry, Berthe
Keywords: ACMCCS98::Computing Methodologies::SYMBOLIC AND ALGEBRAIC MANIPULATION::Algorithms::Analysis of algorithms
ACMCCS98::Computing Methodologies::SYMBOLIC AND ALGEBRAIC MANIPULATION::Algorithms::Algebraic algorithms
Issue Date: 2007
Publisher: University of Nebraska Lincoln
Abstract: This item explains about the asymptotic notation of order of growth of functions.
Description: There are three basic asymptotic Notations.O-notation,o-Notation and Sigma Notation
Appears in Collections:Fundamentals of Algorithms

Files in This Item:

File Description SizeFormat
AsymptoticNotations.pdf211KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback