initialize arrays
type [] name = new int [size]
or
type [] name = {data 1, data 2, data 3, …}
Set value in arrays
name[index] = value
set all values in arrays
for (int i = 0; i< name.length; i++) {
name[i] = values;
}
sequential search in arrays
going through one by one
binary search
splitting it in half and searching through it that way
selection sort
searches and swaps
insertion sort
compares two at a time and swaps them depending on the rule
merge sort
uses recursion
split into two
each piece is sorted
merges them
continues the process till the whole thing is sorted