Arrays/Java - Revision history

Admin: Replacing charlesreid1.com:3000 with git.charlesreid1.com

2019-10-09T03:15:32Z

Replacing charlesreid1.com:3000 with git.charlesreid1.com

← Older revision		Revision as of 03:15, 9 October 2019
Line 121:		Line 121:
	Defining a data structure that uses a dynamically resized array to store underlying data, and works similar to a Python list:		Defining a data structure that uses a dynamically resized array to store underlying data, and works similar to a Python list:

	https://charlesreid1.com~~:3000~~/cs/java/src/master/arrays/python-list/PythonList.java		https://git.charlesreid1.com/cs/java/src/master/arrays/python-list/PythonList.java

	==Notes from Sedgewick and Wayne Java Programming==		==Notes from Sedgewick and Wayne Java Programming==

2017-06-05T22:42:00Z

Questions from Goodrich et al Data Structures in Java Chapter 3

← Older revision		Revision as of 22:42, 5 June 2017
Line 167:		Line 167:

	See [[Arrays/Java/FisherYates]] for more info about the Fisher Yates shuffle method.		See [[Arrays/Java/FisherYates]] for more info about the Fisher Yates shuffle method.



			Two questions, both related, about finding values in an array:

			Question C-3.17) A is an array of size n>=2 containing integers from 1 to n-1, inclusive, one of which is repeated. Describe an algorithm for finding the integer in A that is repeated.

			Question C-3.18) Let B be an array of size n>=6 containing integers from 1 to n-5, inclusive. Five of the integers are repeated. Describe an algorithm for finding the five integers in B that are repeated.

			See [[Arrays/Java/Finding Duplicates]]

	==Questions from Sedgewick==		==Questions from Sedgewick==

2017-06-05T21:48:51Z

Questions from Goodrich et al Data Structures in Java Chapter 3

← Older revision		Revision as of 21:48, 5 June 2017
Line 166:		Line 166:
	See [[Arrays/Java/Repeatedly Remove]] for an algorithm to repeatedly select and remove entries from an array using the Fisher-Yates shuffle.		See [[Arrays/Java/Repeatedly Remove]] for an algorithm to repeatedly select and remove entries from an array using the Fisher-Yates shuffle.

	See [[Arrays/Java/~~Fisher Yates~~]] for more info about the Fisher Yates shuffle method.		See [[Arrays/Java/FisherYates]] for more info about the Fisher Yates shuffle method.

	==Questions from Sedgewick==		==Questions from Sedgewick==

2017-06-05T21:48:05Z

Questions from Goodrich et al Data Structures in Java Chapter 3

← Older revision		Revision as of 21:48, 5 June 2017
Line 164:		Line 164:
	Question R-3.2) Write Java method that repeatedly selects and removes a random entry from an array until the array holds no more entries.		Question R-3.2) Write Java method that repeatedly selects and removes a random entry from an array until the array holds no more entries.

	See [[Arrays/Java/Repeatedly Remove]] for an algorithm to repeatedly select and remove entries from an array using the Fisher-Yates shuffle ~~(see~~ [[Arrays/Java/Fisher Yates]]).		See [[Arrays/Java/Repeatedly Remove]] for an algorithm to repeatedly select and remove entries from an array using the Fisher-Yates shuffle.

			See [[Arrays/Java/Fisher Yates]] for more info about the Fisher Yates shuffle method.

	==Questions from Sedgewick==		==Questions from Sedgewick==

2017-06-05T21:46:47Z

Questions from Goodrich et al Data Structures in Java Chapter 4

← Older revision		Revision as of 21:46, 5 June 2017
Line 160:		Line 160:
	=Questions=		=Questions=

	==Questions from Goodrich et al Data Structures in Java Chapter 4==		==Questions from Goodrich et al Data Structures in Java Chapter 3==

			Question R-3.2) Write Java method that repeatedly selects and removes a random entry from an array until the array holds no more entries.

			See [[Arrays/Java/Repeatedly Remove]] for an algorithm to repeatedly select and remove entries from an array using the Fisher-Yates shuffle (see [[Arrays/Java/Fisher Yates]]).

	==Questions from Sedgewick==		==Questions from Sedgewick==

2017-06-02T21:56:19Z

ThreeSum

← Older revision		Revision as of 21:56, 2 June 2017
Line 180:		Line 180:

	O(n^3), yes, but what else?		O(n^3), yes, but what else?

			The book makes the following statement:

	<math>		<math>
	\binom{n}{3} = \dfrac{n(n-1)(n-2)}{6}		\binom{n}{3} = \dfrac{n(n-1)(n-2)}{6}
	</math>		</math>

			But the book does not explain anything about where the binomial equivalency came from.

	===Any Kind You'd Like===		===Any Kind You'd Like===

2017-06-02T21:55:01Z

Python-like dynamic array list

← Older revision		Revision as of 21:55, 2 June 2017
Line 116:		Line 116:

	===Python-like dynamic array list===		===Python-like dynamic array list===

			{{Main\|Arrays/Java/PythonList}}

	Defining a data structure that uses a dynamically resized array to store underlying data, and works similar to a Python list:		Defining a data structure that uses a dynamically resized array to store underlying data, and works similar to a Python list:

2017-06-02T21:51:54Z

Caesar Cipher

← Older revision		Revision as of 21:51, 2 June 2017
Line 81:		Line 81:

	===Caesar Cipher===		===Caesar Cipher===

			[[Arrays/Java/CaesarCipher]]

	Converting between Strings, chars, and ints:		Converting between Strings, chars, and ints:

2017-06-02T21:51:22Z

Basics of Arrays

← Older revision		Revision as of 21:51, 2 June 2017
Line 47:		Line 47:

	Building an array to hold a basic object - a GameEntry representing a high score entry in a game.		Building an array to hold a basic object - a GameEntry representing a high score entry in a game.

	~~Link: https://charlesreid1.com:3000/cs/java/src/master/arrays/GameEntry.java~~

	The default array element will be null, so an empty array of GameEntry objects contains null pointers		The default array element will be null, so an empty array of GameEntry objects contains null pointers

2017-06-02T21:51:02Z

Array-based Data Structures

← Older revision		Revision as of 21:51, 2 June 2017
Line 36:		Line 36:
	* resizable array under the hood		* resizable array under the hood

	~~List interface docs: http://docs.oracle.com/javase/7/docs/api/java/util/List.html~~		===Abstract Data Types===

	ArrayList class docs: http://docs.oracle.com/javase/7/docs/api/java/util/ArrayList.html		The [[Abstract Data Types]] page has more information about what kind of data structures implement what kind of interfaces.
			* List interface Java API docs: http://docs.oracle.com/javase/7/docs/api/java/util/List.html
			* ArrayList class Java API docs: http://docs.oracle.com/javase/7/docs/api/java/util/ArrayList.html

	==Notes from Goodrich et al Data Structures in Java Chapter 4==		==Notes from Goodrich et al Data Structures in Java Chapter 4==