Pratice on book Introduction to the Design and Analysis of Algorithm(3rd Edition)

Content

Chapter1 Introduction

Euclid’s Algorithm

Consecutive Integer Checking Algorithm

Sieve of Eratosthenes Algorithm

Chapter2 Fundamentals of the Analysis of Algorithm Efficiency

Sequential Search Algorithm

Max Element Algorithm

Unique Elements Algorithm

Matrix Multiplication Algorithm

Binary Algorithm

Factorial Algorithm

Binary Algorithm(recursive version)

Linear Congruential Method

Chapter3 Brute Force and Exhaustive Search

Selection Sort Algorithm

Bubble Sort Algorithm

Sequential Search 2 Algorithm

Brute Force String Match Algorithm

Brute Force Closest Pair Algorithm

Depth-first Search Algorithm

Breadth-first Search Algorithm

Chapter4 Decrease-and-Conquer

Insertion Sort Algorithm

Johnson Trotter Algorithm

Lexicographic Permute Algorithm

Binary Reflected Gray Code

Binary Search Algorithm

Lomuto Partitioning Algorithm

Quick Select Algorithm

Chapter5 Divide-and-Conquer

Merge Sort Algorithm

Hoare Partition Algorithm

Quick Sort Algorithm

Binary Tree Height

Karatsuba Algorithm

Strassen’s Algorithm

Effient Closest Pair Algorithm

Chapter6 Transform-and-Conquer

Gaussian Elimination

AVL tree

2-3 tree