1. DATA STRUCTURE
1.1. TYPE
1.1.1. Stacks
1.1.2. Lists
1.1.3. Aray(JAVA)
1.1.4. class(JAVA)
1.1.5. string(JAVA)
1.1.6. queue
1.1.7. trees
1.1.8. graph
1.2. Operations
1.2.1. Traversing
1.2.1.1. access every record
1.2.2. Searching
1.2.2.1. find location
1.2.3. Insertion
1.2.3.1. add
1.2.4. Deletion
1.2.4.1. remove
1.3. Combination Operation
1.3.1. Updating
1.3.2. Sorting
1.3.3. Merging
2. ALGORITHMS
2.1. STEP
2.1.1. Input
2.1.1.1. Process
2.1.1.1.1. Output
2.2. measurement
2.2.1. Effectiveness
2.2.1.1. Easy 2 Understand
2.2.1.2. EZ 2 Perform
2.2.1.3. Well organized
2.2.2. Correctness
2.2.2.1. output as expected
2.2.3. Termination
2.2.3.1. contains ending
2.2.3.2. happen as planned
2.3. Efficiency
2.3.1. running time
2.3.2. memory usage
2.3.3. Correctness
3. ALGOTHMS ANALYSIS
3.1. Algoritm Complexity
3.1.1. looping fx
3.1.1.1. simple
3.1.1.1.1. linear
3.1.1.1.2. logarithmic
3.1.1.2. nested
3.1.1.2.1. linear
3.1.1.2.2. dependent
3.1.1.2.3. quadratic
3.2. Big-O Notation
3.2.1. O(f(n))
3.2.1.1. no loop
3.2.1.1.1. O(k)
3.2.1.2. simple loop
3.2.1.2.1. O(n)
3.2.1.2.2. O(log2n)
3.2.1.3. nested loop
3.2.1.3.1. O(n^2)
3.2.1.3.2. o(n log2n)
3.2.2. runtime
3.2.2.1. n= 256 x 10^-6 sec