Unit 6: Array

data structure that makes it easier to handle similar types of data.

Primitive or object data types

A seperate piece of data

is used to identify the specific location of this element.

are used to show that an array is present.

They indicate an initializer list

occurs when the indexes go out of bonds from what the array is actually set to.

it provides a variable that will hold each element of an array.

it is used to refer to the current index.

It is called the 2 search algorithms

These search through the data one by one in order, and take a long time to execute.

These search through the data for the desirable value by dividing it into half each time until the desired value is found.

They take data in an array, and rearrange it into a particular order.

This sort searches and swaps.

It compares the first 2 elements, and depending on the outcome of this it inserts the second value in front of the first value into index 0, which moves the first value to index 1.

This type of sort uses recursion.

Technique that uses a method to call itself.