Hey! This blog post features all content from the lecture slides, things Rasmus has said, vital…
How I went from getting an F in every subject (failing GCSEs and A levels) to getting 80–90%s at a…
View the updated (and frankly, much better) article here:
It’s best to show how a Greedy algorithm works with an example.
Let’s say we have 3 coins:
10p
If you want to learn a lot about Graph Theory, check out this article
The seven bridges of Koenigsberg is the foundation and birth of graph theory.
A tree T = (V, E) consists of a set of vertices (V) and a set of edges (E).
The vertices are the “Nodes” in a tree and the edges are the “lines connecting them”.
This is a tree:
We can run threads and programmes at the “same time”.
For example, take the maths equation 3 + 4 + 3 * 2.
You can break this down into (3 + 4) + (3 * 2).
Note: This is more of just my notes on x86 Assembley language than it is an actual blog post.
If you want to find something specific, like how to compare things in assembley do crtl+f “compare”.
