25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Programming]] * [[Algorithms]] * Recursion'''
[[FILE:Bottrop_Halde_Beckstraße_Tetraeder.JPG|border|right|thumb|[https://en.wikipedia.org/wiki/Tetrahedron_in_Bottrop Tetrahedron in Bottrop] <ref>[https://en.wikipedia.org/wiki/Tetrahedron Tetrahedron] in [https://en.wikipedia.org/wiki/Bottrop Bottrop], [https://en.wikipedia.org/wiki/North_Rhine-Westphalia North Rhine-Westphalia], Germany, part of [[:Category:Industrial Heritag Heritage Trail|The Industrial Heritage Trail]], [https://commons.wikimedia.org/wiki/File:Bottrop_-_Halde_Beckstra%C3%9Fe_-_Tetraeder_03_ies.jpg Image] by [[Gerd Isenberg]], April 08, 2017. The design is reminiscent of the [https://en.wikipedia.org/wiki/Sierpinski_triangle#Analogues_in_higher_dimensions Sierpinski tetrix] : placing four half-size tetrahedra corner to corner and adding an octahedron in the middle, a full-size tetrahedron is formed; this process can be repeated recursively to form larger and larger tetrahedra, from [https://en.wikipedia.org/wiki/Tetrahedron_in_Bottrop Tetrahedron in Bottrop from Wikipedia], [https://commons.wikimedia.org/wiki/Category:Tetraeder_Bottrop Category:Tetraeder Bottrop] - [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [http://www.halden.ruhr/halden.html Halden im Ruhrgebiet] (German)</ref> ]]
'''Recursion''' is a technique to define a function, or process of repeating objects, in a [https://en.wikipedia.org/wiki/Self-similarity self-similar] way. In computer science it is a method or algorithm where the solution to a problem depends on solutions to smaller instances of the same problem.
'''[[Algorithms|Up one Level]]'''
[[Category:Industrial Heritag Heritage Trail]]
[[Category:M. C. Escher]]
[[Category:René Magritte]]
