bresenham's line algorithm
Related code examples
which is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
polycarp found a rectangular table consisting of n rows and m columns. he noticed that each cell of the table has its number, obtained by the following algorithm "by columns": codeforces solution