You can choose between these:
1) Merge Sort, Quick Sort and Heap Sort
2) Fourier Transform and Fast Fourier Transform
3) Dijkstra’s algorithm
4) RSA algorithm
5) Secure Hash Algorithm
6) Integer factorization
7) Link Analysis
8) Proportional Integral Derivative Algorithm
9) Data compression algorithms
10) Random Number Generation
Or you can propose your own preferred algorithm
One of my favourites is A* algorithm,
In computer science, A* (pronounced "A star") is a computer algorithm that is widely used in path finding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes.
The secret to its success is that it combines the pieces of information that Dijkstra’s algorithm uses (favouring vertices that are close to the starting point)and information that Greedy Best-First-Search uses (favouring vertices that are close to the goal).
A* is commonly used for the common path finding problem in applications such as games, but was originally designed as a general graph traversal algorithm.
I like simple & beautiful algorithms, for me Euclid s gcd algorithm will always remain beautiful
recursive till n==0
and he wrote this in 300B.C & good luck finding gcd with other methods 😋, try it it's cool,
now u can find LCM too using it
LCM(m,n)* GCD(m,n) = m * n
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games (Tic-tac-toe, Chess, Go, etc.).