What is your favorite algorithm? | Sololearn: Learn to code for FREE!

+88

What is your favorite algorithm?

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 Source: https://medium.com/@_marcos_otero/the-real-10-algorithms-that-dominate-our-world-e95fa9f16c04

10/12/2017 8:17:57 PM

⏩▶Clau◀⏪

125 Answers

New Answer

+29

Alfa-beta algorithm 🆎️🤗

+22

Gauss Algorithm can be understood by undergraduates and is often applicable in different variatios. btw a nice anecdote behind.

+20

binary search!

+18

@Oma Falk nice choice! (disclamer: Gaussian elimination (also known as row reduction) is an algorithm for solving systems of linear equations.)

+15

RSA is in our lifes

+15

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.

+15

As I don't understand the algorithms, so, am I not a developer? :/

+14

I'll go with the fast fourier transformation because I like listening to music and watching videos. (If I had to choose my own, I'm pretty fond of Hindley-Milner.)

+14

+12

I like simple & beautiful algorithms, for me Euclid s gcd algorithm will always remain beautiful gcd(m,n)=gcd(n,m%n) 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

+12

 A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum. Source: Wikipedia

+12

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.).  Source: Wikipedia

+12

+12

Yes.... Brother...

+11

My love algorithm💓 https://code.sololearn.com/cpPaXND5qWvY/?ref=app

+10

Good advice @CodeMaster

+10

thanks

+10

Greedy Algorithm

+9

@Aymen Jarouih Thanks for your input. That algorithm really deserves to be taken into account.

+9

@Norbivar Thank you for expanding your information.