Algorithms For Dummies

Changing the Data Domain

The Fourier Transform and Fast Fourier Transform (FFT) make a huge difference 

in how applications perceive data. These two algorithms transform data from the 

frequency domain (how fast a signal oscillates) to the time domain (the time dif-

ferential between signal changes). In fact, it’s impossible to get any sort of com-

puter hardware degree without having spent time working with these two 

algorithms extensively. Timing is everything.

By knowing how often something changes, you can figure out the time interval 

between changes and therefore know how long you have to perform a task before 

a change in state requires that you do something else. These algorithms com-

monly see use in filters of all sorts. Without the filtering effects of these algo-

rithms, reproducing video and audio faithfully through a streamed connection 

would be impossible. All these applications sound rather advanced, and they are, 

but some amazing tutorials give you a better sense of how these algorithms work 

(see the tutorial at 

http://w.astro.berkeley.edu/~jrg/ngst/fft/fft.html

 as 

an  example).  The  tutorial  at 

https://betterexplained.com/articles/an- 

interactive-guide-to-the-fourier-transform/

 is possibly the most interest-

ing and especially entertaining if you like smoothies.

Analyzing Links

The capability to analyze relationships is something that has made modern com-

puting unique. In fact, the capability to first create a representation of these rela-

tionships and then analyze them is the subject of Part III of this book. The whole 

idea of the web, in fact, is to create connections, and connectivity was a consider-

ation at the start of what has become a worldwide phenomenon. Without the 

capability to analyze and utilize links, applications such as databases and e-mail 

wouldn’t work. You couldn’t communicate well with friends on Facebook.

---

396