Input: Given a graph with N nodes and M weighted edges, we want to obtain the Minimum Spanning Tree (MST) of the graph. Note: MST is a… Read more “Prim’s Running Time With Heaps”

# Category: Misc

## The Unsolvability Halting Problem

Definition Halting problem is a famous problem in computer science. The problem is simply we want to prove and know whether a computer program will be halted… Read more “The Unsolvability Halting Problem”