1. Speed Programming
Continuing…..

2. Sorting Applications: Uniqueness testing Deleting duplicates
Event prioritizing
Median selection
Frequency counting
Set operations
Finding target pairs
Efficient searching

3. Sorting algorithms Insertion Selection Bubble or exchange sort
Shell-sort (insertion with diminishing increment)
Heapsort
Quicksort
mergesort

4. Numeric algorithms Use integers whenever possible
Exponentiation is sometimes better done by square and multiply.
Beware of number bases
Base conversions

5. Different Kinds of Numbers
Real Numbers.
Integers
Rational numbers
Fractions

6. Algebra with Polynomials
Data structure
Add
Subtract
Multiply