Thoughts on Linux threads implementation
An apparent answer for why Linux designers disallow external interrupt handler to sleep is that, of course, these handlers are meant to r...…
Comparing local search algorithms with path-constructing algorithms
In searching algorithms, local search is a class of algorithms that propose a solution and continue modifying it until it looks good enou...…
Intuitive explanation of the square root branching factor
By best-case, it means that, when choosing a node to expand, the algorithm always chooses in the optimal order. i.e.
order that retur...…
Mathematical proof of algorithms including heapify, heap construction and heap sort
Heapify(array \(A\) with size \(N\), index \(i\) that contains node \(n\)):
Assuming subtrees of node \(n\) are max heaps.
Idea: cor...…
Inspect the pseudo-code of recursive best first search
The idea of recursive best first search is to simulate A* search with \(O(bd)\) memory, where \(b\) is the branching factor and \(d\) is ...…