1. Search and Sort

2. Binary Search

3. Bubble Sort
An example on bubble sort. Starting from the beginning of the list,compare every adjacent pair, swap their position if they are not in the right order(the latter one is smaller than the former one). After each iteration, one less element (the last one) is needed to be compared until there is no more element left to be compared.

4. Insertion Sort
An example on insertion sort. Check each element and put them in the right order in the sorted list.

5. Quick Sort
Divide and Conquer!!

6. Quick Sort

7. 2d Arrays 78 9 98 1 2 h nips 213 5 6 4 d 13 jop kol moose silla gobi9 98 1 2 h
nips
213 5 6 4 d 13
jop
kol
moose
silla
gobi 45 32

8. Sort Comparisons http://www.sorting-algorithms.com/bubble-sort

9. Bubble Vs Quick When is quick sort quicker than bubble sort
When is bubble sort quicker than quick sort
Which is generally quicker?

10. Describe Sort Describe how Bubble sort works
Describe how quick sort works as best you can

11. Question 14 A procedure is required that can sort a list of randomly arranged items. This list can be of any given size. Two separate procedures are written, one using a quick sort algorithm and the other using a bubble sort algorithm. The performance of each procedure is compared by measuring the time it takes to sort an increasing number of list items. The results are shown below.
The graph line that most likely represents the performance of the bubble sort is A.  neither (1) nor (5) because a bubble sort cannot sort very large lists. B.  (2) because a bubble sort generally takes less time than a quick sort. C.  (1) because a bubble sort generally takes more time than a quick sort. D.  neither (1) nor (2) because the time taken for a bubble sort does not depend on the list size.

12. Binary Sort What is one prerequisite required to use a binary sort
What philosophy does the binary sort work on?