OpenStax CNX

You are here: Home » Content » DFT: Computational Complexity

About: DFT: Computational Complexity

Module by: Don Johnson. E-mail the author

View the content: DFT: Computational Complexity


Name: DFT: Computational Complexity
ID: m0503
Language: English (en)
Summary: A brief explanation of calculation complexity and how the complexity of the discrete Fourier transform is order N squared.
Subject: Mathematics and Statistics
Keywords: computational complexity, discrete fourier transform
License: Creative Commons Attribution License CC-BY 3.0

Authors: Don Johnson (
Copyright Holders: Don Johnson (
Maintainers: Don Johnson (, CJ Ganier (, John Cottrell (

Latest version: 2.12 (history)
First publication date: Jul 18, 2000 12:00 am +0000
Last revision to module: May 17, 2013 9:52 am +0000


PDF: m0503_2.12.pdf PDF file, for viewing content offline and printing. Learn more.
XML: m0503_2.12.cnxml XML that defines the structure and contents of the module, minus any included media files. Can be reimported in the editing interface. Learn more.

Version History

Version: 2.12 May 17, 2013 9:52 am +0000 by Don Johnson
Fixed a typo.

Version: 2.11 Apr 13, 2005 9:22 am +0000 by Charlet Reedstrom
update to cnxml-0.5, update mathml

Version: 2.10 Jul 27, 2003 3:59 pm +0000 by Don Johnson
Fixed intermodule link errors.

Version: 2.9 Nov 20, 2002 12:00 am +0000 by (Unknown)
Fixed typos.

Version: 2.8 Aug 13, 2002 12:00 am +0000 by (Unknown)
Upgraded to 0.4.

Version: 2.7 Aug 3, 2002 12:00 am +0000 by (Unknown)
fixed some typos.

Version: 2.6 Apr 19, 2002 12:00 am +0000 by (Unknown)
audited for mathml and cnxml errors

Version: 2.5 Sep 11, 2001 12:00 am +0000 by Brent Hendricks
Converted to CNXML 0.3.5

Version: 2.4 Aug 22, 2001 12:00 am +0000 by (Unknown)
Made O() a function

Version: 2.3 Jul 17, 2001 12:00 am +0000 by (Unknown)
added keywords
made John Cottrell a maintainer
fixed minor errors

Version: 2.2 Jun 5, 2001 12:00 am +0000 by (Unknown)
Corrected big O notation to be a presentation ML notation rather than a function in Content ML.  Also fixed some capitalization.

Version: 2.1 May 31, 2001 12:00 am +0000 by (Unknown)
Replaced some emphasis with term.

Version: 2.0 Oct 17, 2000 12:00 am +0000 by Brent Hendricks
Bumped version to 2.0

How to Reuse and Attribute This Content

If you derive a copy of this content using a OpenStax-CNX account and publish your version, proper attribution of the original work will be automatically done for you.

If you reuse this work elsewhere, in order to comply with the attribution requirements of the license (CC-BY 3.0), you must include

  • the authors' names: Don Johnson
  • the title of the work: DFT: Computational Complexity
  • the OpenStax-CNX URL where the work can be found:

See the citation section below for examples you can copy.

How to Cite and Attribute This Content

The following citation styles comply with the attribution requirements for the license (CC-BY 3.0) of this work:

American Chemical Society (ACS) Style Guide:

Johnson, D. DFT: Computational Complexity, OpenStax-CNX Web site., May 17, 2013.

American Medical Assocation (AMA) Manual of Style:

Johnson D. DFT: Computational Complexity [OpenStax-CNX Web site]. May 17, 2013. Available at:

American Psychological Assocation (APA) Publication Manual:

Johnson, D. (2013, May 17). DFT: Computational Complexity. Retrieved from the OpenStax-CNX Web site:

Chicago Manual of Style (Bibliography):

Johnson, Don. "DFT: Computational Complexity." OpenStax-CNX. May 17, 2013.

Chicago Manual of Style (Note):

Don Johnson, "DFT: Computational Complexity," OpenStax-CNX, May 17, 2013,

Chicago Manual of Style (Reference, in Author-Date style):

Johnson, D. 2013. DFT: Computational Complexity. OpenStax-CNX, May 17, 2013.

Modern Languages Association (MLA) Style Manual:

Johnson, Don. DFT: Computational Complexity. OpenStax-CNX. 17 May 2013 <>.