ALL POSTS
The Master Theorem For Time Complexity
In this article, we will model the time complexity of divide and conquer using mathematical methods, analyze its asymptotic properties, and provide three methods of calculation.
The Bash Game
A pile of stones, two people take turns to take at least 1 stone and at most 2 stones. Whoever gets the last stone loses.
Fast Inverse Square Root
The article introduces an algorithm called Fast Inverse Square Root, which is used to quickly calculate the inverse square root of a floating point number.
How Do Computer Calculate the Log-Function
送東陽馬生序
Moore's Voting Algorithm for Finding Majority Element
Moore's Voting Algorithm is an algorithm used to find the element that appears more than half the time in an array.
A Star Algorithm
A* search algorithm is a path finding algorithm that finds the single-pair shortest path between the start node(source) and the target node(destination) of a weighted graph.
Rabin-Karp Algorithm
It is designed to address the multiple pattern string matching problem.
Joseph Circle Problem
A description, analysis and solution for joseph circle problem.
Use Differential Equation Method and Matrix Method to Find Fibonacci Sequence General Formula
This article gives two methods to derive Fibonacci sequence: matrix method and difference equation method