BubbleSort

**Searching Algorithms**
__**Sequential Search Algorithm**__ Uses a loop to sequentially step through an array to find a specific item in a collection of data. A flag is used to exit the loop one it is found. __**The Binary Search Algorithm**__ Clever algorithm and more efficient than others but the values in the arrary must be sorted in ascending order. Starts with the element in the middle and compares it to the value and then goes up or down thus reducing half the array's elements. Returns -1 if value does not exist. Example: 0 5 13 19 22 41 55 68 72 81 98 55 68 72 81 98  55 68 __**Binary Search Tree**__

**Sorting Algorithms**
[|Sorting Types]

[|Bubble Sort Description] [|Bubble Sort Illustration]
 * Selection Sort**
 * Bubble Sorts**
 * Quicksort**


 * The BigO Notation is a method is used to determine the performance of the algorithm based on the data being arrange in a worst case order. Performance is determined by efficiency: running time and memory usage.**
 * [|BigO]**
 * [|BigO]**

__** Advantages/Disadvantages **__ __** Searches **__
 * 1) Sequential Search Algorithm
 * 2) Advantage: Simple
 * 3) Disadvantage: Not efficient
 * 4) Binary Search Algorithm
 * 5) Advantage: Efficient and clever
 * 6) Disadvantage: The array must be sorted first
 * 7) Binary Tree SearchItem
 * 8) Advantage: Very efficient
 * 9) Disadvantage: algorithms can get complicated

__** Sorts **__
 * 1) Selection Sort Algorithm - BigO Efficiency in Average Data Arrangement Case = n2 (n squared)
 * 2) Advantage: Simple
 * 3) Disadvantage: Not efficient
 * 4) Bubble Sort - BigO Efficiency in Average Data Arrangement Case = n2 (n squared)
 * 5) Advantage: Simple
 * 6) Disadvantage: Not efficient for large lists
 * 7) Quicksort - BigO Efficiency in Average Data Arrangement Case = O(n log n)
 * 8) Advantage: Efficient and fast sort
 * 9) Disadvantage: Worst-case complexity rating is poor
 * 10) Uses recursion
 * 11) HeapSort - BigO Efficiency in Average Data Arrangement Case = n log n
 * 12) Advantage: Efficient and fast sort
 * 13) Disadvantage: Usually slower than a quicksort