## [Scheme] Scheme – examples – 3 sorting algorithms + depth of tree

Here are my 3 basic sorting algorithms written in Scheme:

Tag: algorithm

Here are my 3 basic sorting algorithms written in Scheme:

If we want to know the last ten digits of number an – we have to evaluate expression an mod 1010. Using brute force approach, we have to do O(n) ( If you don’t understand big „O” notation, visit: Big O notation – it’s VERY important) multiplications and modulo divisions. When n is greater than 109, it will take a lot of time. Fortunately, we can use more „mathematical” approach, which has O(log n) complexity.