10 Classic Algorithms That Shaped Modern Computing – From Sorting to Encryption

What is an algorithm? In short, any well‑defined computational procedure that takes one or more inputs and produces one or more outputs (source: Thomas H. Cormen, Charles E. Leiserson, "Introduction to Algorithms, 3rd Edition").

An algorithm solves a specific problem through a series of steps and possesses three crucial properties:

Finite: it must terminate after a limited number of steps.

Exact: each step is precisely defined.

Feasible: it can be executed within a reasonable amount of time for the given problem.

Although algorithms are widely used in computing, they originated in mathematics; the earliest known mathematical algorithms date back to the Babylonians (c. 1600 BC) for factorization and square‑root extraction.

1. Merge Sort, Quick Sort, and Heap Sort

These three sorting algorithms illustrate different trade‑offs in efficiency and stability. Merge sort, invented by John von Neumann in 1945, is a classic divide‑and‑conquer method. Quick sort combines partitioning with divide‑and‑conquer and performs well on random arrays. Heap sort uses a priority‑queue structure to reduce search time during sorting.

2. Fourier Transform and Fast Fourier Transform (FFT)

The Fourier transform and its fast variant enable conversion between time‑domain and frequency‑domain representations, a cornerstone of digital signal processing, communications, and many other technologies.

3. Dijkstra's Shortest‑Path Algorithm

Dijkstra's algorithm finds the shortest distance between two nodes in a graph, a fundamental technique for routing in the Internet and many other networked systems.

4. RSA Asymmetric Encryption

RSA, proposed by the three founders of RSA Security, underpins modern public‑key cryptography, allowing secure key exchange and protecting data transmitted over the Internet.

5. Secure Hash Algorithms (SHA)

SHA refers to a family of cryptographic hash functions standardized by the U.S. National Institute of Standards and Technology, used to verify data integrity in software distribution, email, browsers, and many other applications.

6. Integer Factorization

Integer factorization decomposes a composite number into its prime factors; it is a key component of many encryption schemes, including RSA.

7. Link‑Analysis Algorithms

Link‑analysis algorithms model the web as a graph and compute eigenvalues to assess node importance; they power search‑engine ranking, social‑network recommendations, and other graph‑based analyses.

8. Proportional‑Integral‑Derivative (PID) Control

PID control regulates feedback loops in aircraft, automobiles, industrial robots, and many other systems by minimizing the error between desired and actual outputs.

9. Data Compression Algorithms

Various compression techniques (e.g., MP3, JPEG, MPEG‑2) reduce file sizes for audio, images, and video, enabling efficient storage, transmission, and cloud computing.

10. Pseudorandom Number Generation

Pseudorandom generators produce sequences that appear random and are essential for networking, cryptography, AI, simulations, and many other domains.

—THE END—