TADM2E 5.31 - Revision history

Matt: Undo revision 790 by EthanGamer (talk)

2020-07-23T13:37:55Z

Undo revision 790 by EthanGamer (talk)

2020-07-14T01:57:49Z

Replaced content with "*Kgz"

2017-01-03T06:20:57Z

Implicit stack is *not* the standard practice in the real world.

2014-09-11T18:14:17Z

Recovering wiki

New page

*For BFS, queues are used.

*For DFS, stacks are used. Normally in real implementation, we use recursion in place of an explicit stack.

← Older revision		Revision as of 13:37, 23 July 2020
Line 1:		Line 1:
−	*~~Kgz~~	+	*For BFS, queues are used.
		+
		+	*For DFS, stacks are used. The use of recursion is using the language-managed stack to store the intermediate state in place of an explicit stack. However since in practice the size of the stack is limited, robustness dictates to use an explicit stack for any real-world program that needs to deal with an unbounded maximum depth recursion.

← Older revision		Revision as of 01:57, 14 July 2020
Line 1:		Line 1:
−	*~~For BFS, queues are used.~~	+	*Kgz
−
−	*For DFS, stacks are used. The use of recursion is using the language-managed stack to store the intermediate state in place of an explicit stack. However since in practice the size of the stack is limited, robustness dictates to use an explicit stack for any real-world program that needs to deal with an unbounded maximum depth recursion.

← Older revision		Revision as of 06:20, 3 January 2017
Line 1:		Line 1:
	*For BFS, queues are used.		*For BFS, queues are used.

−	*For DFS, stacks are used. ~~Normally in real implementation, we~~ use recursion in place of an explicit stack.	+	*For DFS, stacks are used. The use of recursion is using the language-managed stack to store the intermediate state in place of an explicit stack. However since in practice the size of the stack is limited, robustness dictates to use an explicit stack for any real-world program that needs to deal with an unbounded maximum depth recursion.