StacksQueues - Revision history

Admin: /* Goodrich */

2017-09-05T09:12:20Z

Goodrich

← Older revision		Revision as of 09:12, 5 September 2017
Line 13:		Line 13:
	[[StacksQueues/Java]]		[[StacksQueues/Java]]

	==Goodrich==		==Goodrich Chapter 6==

	===Stacks===		===Stacks===

Admin: /* Skiena Chapter 3 */

2017-06-04T08:16:14Z

Skiena Chapter 3

← Older revision		Revision as of 08:16, 4 June 2017
Line 12:		Line 12:

	[[StacksQueues/Java]]		[[StacksQueues/Java]]

			==Goodrich==

			===Stacks===

			Stacks are LIFO objects that provide the following methods:
			* push
			* pop

			You can implement other convenience methods, but that's the basic concept.
			* top or peek
			* size
			* isEmpty

			The stack class in Java Collections framework provides a built-in object that's fully functional and very fast.

			Two implementations guided by Goodrich book:
			* [[StacksQueues/Java/ArrayStack]] - array-based data structure (dynamically-resized array) implementation of Stack
			* [[StacksQueues/Java/LinkedStack]] - link-based data structure (singly-linked list) implementation of Stack

	==Skiena Chapter 3==		==Skiena Chapter 3==

Admin: /* Skiena Chapter 3 */

2017-06-03T06:47:50Z

Skiena Chapter 3

← Older revision		Revision as of 06:47, 3 June 2017
Line 14:		Line 14:

	==Skiena Chapter 3==		==Skiena Chapter 3==

			===Basics of stacks and queues===

	Stacks and queues provide a container that permits storage and retrieval of data items ''independent of content.''		Stacks and queues provide a container that permits storage and retrieval of data items ''independent of content.''
Line 37:		Line 39:
	These can be implemented using arrays or linked lists, with or without an upper bound.		These can be implemented using arrays or linked lists, with or without an upper bound.

			===Priority queues===

			See [[Priority Queues]]




	=Flags=		=Flags=

	{{CSFlag}}		{{CSFlag}}

Admin at 06:47, 3 June 2017

2017-06-03T06:47:10Z

@@ Line 1: / Line 1: @@
 ==Stacks and Queues - why==
-Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1).
+Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1). (See [[Abstract Data Types]] page for a comparison table.)
 Stacks - last-in, first-out data structure where things are added and removed from the top.
@@ Line 8: / Line 10: @@
 [[StacksQueues/Python]]
-==Flags==
+=Flags=
 {{CSFlag}}

Admin at 06:12, 30 May 2017

2017-05-30T06:12:12Z

← Older revision		Revision as of 06:12, 30 May 2017
Line 1:		Line 1:
			==Stacks and Queues - why==

	Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1).		Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1).

Line 6:		Line 8:

	[[StacksQueues/Python]]		[[StacksQueues/Python]]



			==Flags==

			{{CSFlag}}

Admin: Created page with "Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1). Stacks - last-in, first-out data structure where t..."

2017-05-30T05:32:00Z

Created page with "Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1). Stacks - last-in, first-out data structure where t..."

New page

Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1).

Stacks - last-in, first-out data structure where things are added and removed from the top.

Queues - first-in, first-out data structure where things are removed from the front and added to the back.

[[StacksQueues/Python]]