YSU Algorithm Mid Lectures

Lecture 1

• Insertion Sort
• Loop Invariant

• Time Complexity

• Asymptotic analysis

• Merge Sort

Lecture 2

• Asymptotic Notation - for non-tight bound

• Recurrence relation - for tight bound
• Induction
• Recursion-tree method





• The Master Method

Lecture 3

• Divide and Conquer paradigm
• Merge Sort
• Binary Search
• Fibonacci sequence
• Strassen’s Algorithm

Lecture 4

• Quick Sort

Lecture 5

• Comparison sort

• Counting Sort

Lecture 6

Lecture 7

Search Algorithm

Dynamic Programming

• Divide and Conquer paradigm

Algorithms