24
edits
Changes
→Power Point Attached
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT).
[[File:https://wiki.cdot.senecacollege.ca/w/imgs/Download.jpg]]
==== Random Number Generator ====
== Power Point Attached Presentation == Animated GIF of the Presentation [[File:Intel Math Kernel Library.gif]] PDF File:
[File:https://wiki.cdot.senecacollege.ca/w/imgs/Intel_Math_Kernel_Library.pdf]