In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

At the most basic level, algorithms are a bunch of if-then statements taking place in a computer very quickly to give you an outcome: If you do A then you get B. If you do C instead, then you get D.

This note describes a basic algorithm developed by the IMF to balance supply and use tables automatically, allowing a much faster SUT balancing process. For training purposes, this algorithm has been ...