10 medium com 1 Merge Sort Quick Sort

ΟΙ 10 ΑΛΓΟΡΙΘΜΟΙ ΤΗΣ ΖΩΗΣ ΜΑΣ (medium. com) 1. Merge Sort, Quick Sort and Heap Sort 2. Fourier Transform and Fast Fourier Transform 3. Shortest Paths - 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

Merge Sort, Quick Sort and Heap Sort

Shortest Paths -Dijkstra’s algorithm

Google uses Shortest Paths

Link Analysis

Link Analysis 2

Γραμμική Αναζήτηση 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

Γραμμική Αναζήτηση (2) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

Δυαδική Αναζήτηση 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

Ο κανόνας του 37 % (optimal stopping) 2 Για δυο επιλογές 50 -50, Για τρείς επιλογές 33%, Για 4 επιλογές 25%, … For big N, we can make it even more simple: P(M, N) =~ (M/N)ln(N/M) 1/e is about 0. 368. This result can be expressed simply in the following "37%" rule: Look at a fraction 1/e of the potential partners before making your choice and you'll have a 1/e chance of finding the best one!