CSC 216/s08/prevent error - Revision history

Eslifka: /* Psuedocode */

2008-04-22T00:32:26Z

Psuedocode

← Older revision		Revision as of 00:32, 22 April 2008
Line 59:		Line 59:
	'''return''' result		'''return''' result

	A full version of merge sort written in Java can be found [[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216/s08/prevent_error/page2]]		A full version of merge sort written in Java can be found [http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216/s08/prevent_error/page2 here]
	~~[[prevent error/page2]~~]

	===The Exercise===		===The Exercise===

2008-04-22T00:29:22Z

Psuedocode

← Older revision		Revision as of 00:29, 22 April 2008
Line 60:		Line 60:

	A full version of merge sort written in Java can be found [[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216/s08/prevent_error/page2]]		A full version of merge sort written in Java can be found [[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216/s08/prevent_error/page2]]
			[[prevent error/page2]]

	===The Exercise===		===The Exercise===

2008-04-22T00:26:27Z

Psuedocode

← Older revision		Revision as of 00:26, 22 April 2008
Line 59:		Line 59:
	'''return''' result		'''return''' result

	A full version of merge sort written in Java can be found [[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216/s08/prevent_error/page2~~\|here~~]]		A full version of merge sort written in Java can be found [[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216/s08/prevent_error/page2]]

	===The Exercise===		===The Exercise===

2008-04-22T00:25:55Z

Psuedocode

← Older revision		Revision as of 00:25, 22 April 2008
Line 58:		Line 58:
	append rest(right) to result		append rest(right) to result
	'''return''' result		'''return''' result

			A full version of merge sort written in Java can be found [[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216/s08/prevent_error/page2\|here]]

	===The Exercise===		===The Exercise===

2008-04-21T14:33:31Z

The Concept

← Older revision		Revision as of 14:33, 21 April 2008
Line 15:		Line 15:

	====The Concept====		====The Concept====
	[[Image:Merge sort algorithm diagram.svg.png\|~~frame~~\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]		[[Image:Merge sort algorithm diagram.svg.png\|thumb\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]

	Merge Sort runs in the following way.		Merge Sort runs in the following way.

2008-04-21T14:33:05Z

The Concept

← Older revision		Revision as of 14:33, 21 April 2008
Line 15:		Line 15:

	====The Concept====		====The Concept====
	[[Image:Merge sort algorithm diagram.svg.png\|~~thumb~~\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]		[[Image:Merge sort algorithm diagram.svg.png\|frame\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]

	Merge Sort runs in the following way.		Merge Sort runs in the following way.

2008-04-21T13:57:41Z

Merge Sort

← Older revision		Revision as of 13:57, 21 April 2008
Line 59:		Line 59:
	'''return''' result		'''return''' result

	===Participants and props===		===The Exercise===

			The rest of this page is devoted to a learning exercise designed to help students understand Merge Sort.

			====Participants and props====

	This exercise can be done with any number of students. Preferably there should be ten or more students participating. No other props are required.		This exercise can be done with any number of students. Preferably there should be ten or more students participating. No other props are required.

	===The script===		====The script====

	We shall teach merge sort by sorting a group of students. There are many ways that students can be sorted, for this example we shall use height.		We shall teach merge sort by sorting a group of students. There are many ways that students can be sorted, for this example we shall use height.

2008-04-21T13:55:10Z

The Algorithm

← Older revision		Revision as of 13:55, 21 April 2008
Line 15:		Line 15:

	====The Concept====		====The Concept====
			[[Image:Merge sort algorithm diagram.svg.png\|thumb\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]

	Merge Sort runs in the following way.		Merge Sort runs in the following way.
	#Divide the unsorted list in half creating two unsorted lists.		#Divide the unsorted list in half creating two unsorted lists.
Line 23:		Line 25:
	#A smaller list is easier to sort than a large list.		#A smaller list is easier to sort than a large list.
	#Two lists that are already sorted are easier to merge into a sorted list than two unsorted lists.		#Two lists that are already sorted are easier to merge into a sorted list than two unsorted lists.

	~~[[Image:Merge sort algorithm diagram.svg.png\|thumb\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]~~

	====Psuedocode====		====Psuedocode====

2008-04-21T13:54:26Z

The Algorithm

← Older revision		Revision as of 13:54, 21 April 2008
Line 24:		Line 24:
	#Two lists that are already sorted are easier to merge into a sorted list than two unsorted lists.		#Two lists that are already sorted are easier to merge into a sorted list than two unsorted lists.

	~~====A Diagram====~~
	[[Image:Merge sort algorithm diagram.svg.png\|thumb\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]		[[Image:Merge sort algorithm diagram.svg.png\|thumb\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]

2008-04-21T13:53:09Z

A Diagram

← Older revision		Revision as of 13:53, 21 April 2008
Line 25:		Line 25:

	====A Diagram====		====A Diagram====
	[[Image:Merge sort algorithm diagram.svg.png\|~~frame~~\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]		[[Image:Merge sort algorithm diagram.svg.png\|thumb\|An easy to follow diagram taken from [http://en.wikipedia.org/wiki/Merge_sort Wikipedia]]]

	====Psuedocode====		====Psuedocode====