• kadane’s algorithm - Largest Sum Contiguous Subarray
• Moore’s voting algorithm - Finding the majority of a sequence of elements using linear time and constant space
• Factorial Trailing Zeroes
• Dynamic Programming - Simplifying a decision by breaking it down into a sequence of decision steps over time.
• Floyd’s Cycle detection - Finding a cycle in a sequence of iterated function values.
• Sieve of Eratosthenes - Simple, ancient algorithm for finding all prime numbers up to any given limit

赞微海报分享