TMM26
(Move to ...)
Home
▼
Searching Algorithms
›
Linear/Sequential Search A linear/sequential search algorithm looks at each element in the array until it finds what it's looking for. ...
Sorting Algorithms
›
Selection Sort The selection sort algorithm orders array elements by finding the smallest element in the array. This element is exchanged w...
Recursion
›
A recursive function is one that calls itself in the method body. A recursive function breaks down a problem into smaller iterative pieces...
ArrayLists
›
ArrayLists store a variable number of objects. The size of an ArrayList is not fixed. We've got 6 methods of the ArrayList class: m...
Arrays
›
Think of arrays as a list of variables or objects. Here are some examples of constructing an array: int[] n = new int[3]; double[]...
Random class
›
Methods of the Random class: nextInt() returns a random int nextInt(int bound) returns a random int from 0 (inclusive) to bound(exclusiv...
DeMorgan's Law
›
!(A && B) is the same as !A || !B !(A || B) is the same as !A && !B Something cool to think about.
›
Home
View web version