Though such efficient algorithms as BinarySearch and quicksort are usually written to use this, its use on most Von Neumann machines makes an algorithm's runtime and memory usage greater than those of an analogous algorithm utilizing only iteration.
The use of stacks to implement this was inaugurated by Edsger Dijkstra in his development of a complier for ALGOL 60 and is used in now almost all compiled languages. Though such efficient algorithms as BinarySearch and quicksort are usually written to use this, its use on most Von Neumann machines makes an algorithm's runtime and memory usage greater than those of an analogous algorithm utilizing only iteration. For ten points, name the feature that an algorithm that calls itself is said to utilize.
The use of stacks to implement this was inaugurated by Edsger Dijkstra in his development of a complier for ALGOL 60 and is used in now almost all compiled languages.
recursion (prompt on "recursive")