Lesson8

Arrays
Most programming languages, including Java, provide a data structure called an array, which consists of an ordered collection of similar items. An array, as a whole, has a single name, and the items in an array are referred to in terms of their position within the array. Disadvantage of an array: Must know how many elements you want to store and request allocation for OR just request more so you don't run out of storage.

Data can also be stored in dynamic data structures like linked list, doubly linked list or circularly linked list. Using these data structures other abstract data types can be formed to store and arrange data such as: stacks, queues and binary trees.

array - A data structure whose elements are accessed by means of index positions. element - A value that is stored in an array. subscript/index - The relative position of the components of an array. Out of Bounds Exception - An error resulting from referencing an array using a subscript/index that does not exist. initializer list - initialising an array with a lists of elements when it is declared.
 * Vocabulary**

Supportive Information: [|Arrays explained in C]


 * Know how the following sorts and searches work for a test and their advantages and disadvantages:**
 * Do a search on the BigO Notation. This method is used to determine the performance of the algorithm. Also try these links:**
 * [|BigO]**
 * [|BigO]**
 * Searches**
 * 1) Sequential Search Algorithm
 * 2) Advantage: Simple
 * 3) Disadvantage: Not efficient
 * 4) Binary Search Algorithm
 * 5) Advantage: Efficient and clever
 * 6) Disadvantage: The array must be sorted first
 * Sorts**
 * 1) Selection Sort Algorithm
 * 2) Advantage: Simple
 * 3) Disadvantage: Not efficient for large lists
 * 4) Bubble Sort
 * 5) Advantage: Simple
 * 6) Disadvantage: Not efficient
 * 7) Quicksort
 * 8) Efficient and fast sort
 * 9) Uses recursion

one dimensional int array referenced as tests two dimensional double array referenced as hours
 * Declare an example of the following arrays:**

Stacks & Queues
[|Stacks & Queues Lesson]