Accompanying lecture notes: https://www.cl.cam.ac.uk/teaching/2122/ConcDisSys/dist-sys-notes.pdf These videos form an 8-lecture series on distributed systems...
external merge sort is a merge sort that is used when size of the list you want to sort is too huge for your fast memory to store. The algorithm divides a list into multiple chunks that fit your fast memory and runs merge sort to each.
geohash is a data structure connecting certain area and hash key. bigger area contain smaller areas. smaller areas' key inherits the parent area's one like the child one is just added one letter from the parent one.
PAXOS is a method for ensuring networked computers reach agreement. e.g. This is used for one leader node to be in charge of working on a locked task among multiple nodes in distributed system.
Lecture videos from the Stanford University course CS193p, Developing Applications for iOS using SwiftUI. These lectures were delivered on-line (due to the n...
Pick's Theorem represents the area of polygon whose vertices are on the integer lattice is given by the formula Area = i + b/2 - 1. (i: number of lattice in the polygon, b: number of vertices on the edges)
Stable marriage problem is an optimal matching problem of two groups. There are two groups A and B. A has the ranked preference order of B. So does B. Firstly, matchings are made by A's preference then if there is duplication, B's preference priority is applied until everyone is matched.
Treap is a data structure that is a combination of binary search tree and heap. e.g. Each node has key and value. Key belongs to BST rule and value belongs to heap rule.