Visit Homework Solution for any kind of help. 1. Compare functions. Big-O, Big-Omega, Small-o, Small-Omega, Big Theta. Chapter 3. Do problem 3-3 and 3-2. Pg 58

2. Linear Search, Binary Search, Bubble Sort, Insertion Sort, Selection Sort. Know the algorithms. Do the runtime analysis and come up with the recursion relation or loop invariant. Do problem 2-2 from pg 38.

3. Merge Sort. Know the algorithm. Runtime analysis of merge sort. Loop invariant of merge.

4. Solving Recurrence. Master Method, Substitution method, Change of variables, Recursion tree. Chapter 4. Do problem 4-1 and 4-4 pg 85, 86.

5. Heap, Max-Heapify, BuildMaxHeap, HeapSort, PriorityQueue, Min-Heap, Max-Heap, Finding ith Largest element, Heap-Increase key. Know the runtime analysis of all the above mentioned algorithm. Do problem 6-1 Pg 142.

6. QuickSort. Know the quick sort algorithm. Know the partition algorithm. Know the runtime of partition algorithm. Balanced, and unbalanced algorithm. Runtime analysis of Quick sort. Best case, Worst case and average case analysis.

7. Binary Tree, Binary Search Tree, Height, Depth, Balanced, Complete, Full, Leaf, Internal node, path, root, subtree, recursive definition of a tree.

Visit Homework Solution for any kind of homework help.