https://github.com/weiaicunzai/pratice-on-book-introduction-to-the-design-and-analysis-of-algorithm
Pratice on book Introduction to the Design and Analysis of Algorithm
https://github.com/weiaicunzai/pratice-on-book-introduction-to-the-design-and-analysis-of-algorithm
Last synced: 2 months ago
JSON representation
Pratice on book Introduction to the Design and Analysis of Algorithm
- Host: GitHub
- URL: https://github.com/weiaicunzai/pratice-on-book-introduction-to-the-design-and-analysis-of-algorithm
- Owner: weiaicunzai
- Created: 2018-09-22T05:37:23.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2019-08-26T16:43:33.000Z (almost 6 years ago)
- Last Synced: 2025-02-04T19:39:06.849Z (4 months ago)
- Language: C++
- Homepage:
- Size: 119 KB
- Stars: 4
- Watchers: 4
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Pratice on book [Introduction to the Design and Analysis of Algorithm(3rd Edition)](https://www.amazon.com/Introduction-Design-Analysis-Algorithms-3rd/dp/0132316811/ref=sr_1_2?keywords=Introduction+to+the+Design+and+Analysis+of+Algorithms&qid=1564471585&s=books&sr=1-2)
![book cover][logo]
[logo]: 61Pe23-FeLL._SX402_BO1,204,203,200_.jpg
This is the practice of book **Introduction to the Design and Analysis of Algorithm(3rd Edition)** when I reading it, all the **pseudocode examples** in the book are implementated in C++ with C++11 standard.
# Content
## Chapter1 Introduction
### [Euclid’s Algorithm](Chapter1/Euclid.cpp)
### [Consecutive Integer Checking Algorithm](Chapter1/ConsecutiveIntegerChecking.cpp)
### [Sieve of Eratosthenes Algorithm](Chapter1/Sieve.cpp)
## Chapter2 Fundamentals of the Analysis of Algorithm Efficiency
### [Sequential Search Algorithm](Chapter2/SequentialSearch.cpp)
### [Max Element Algorithm](Chapter2/MaxElement.cpp)
### [Unique Elements Algorithm](Chapter2/UniqueElements.cpp)
### [Matrix Multiplication Algorithm](Chapter2/MatrixMultiplication.cpp)
### [Binary Algorithm](Chapter2/Binary.cpp)
### [Factorial Algorithm](Chapter2/Factorial.cpp)
### [Binary Algorithm(recursive version)](Chapter2/BinaryRecursive.cpp)
### [Linear Congruential Method](Chapter2/Random.cpp)
## Chapter3 Brute Force and Exhaustive Search
### [Selection Sort Algorithm](Chapter3/SelectionSort.cpp)
### [Bubble Sort Algorithm](Chapter3/BubbleSort.cpp)
### [Sequential Search 2 Algorithm](Chapter3/SequentialSearch2.cpp)
### [Brute Force String Match Algorithm](Chapter3/BruteForceStringMatch.cpp)
### [Brute Force Closest Pair Algorithm](Chapter3/BruteForceClosestPair.cpp)
### [Depth-first Search Algorithm](Chapter3/DepthFirstSearch.cpp)
### [Breadth-first Search Algorithm](Chapter3/BreadthFirstSearch.cpp)
## Chapter4 Decrease-and-Conquer
### [Insertion Sort Algorithm](Chapter4/InsertionSort.cpp)
### [Johnson Trotter Algorithm](Chapter4/JohnsonTrotter.cpp)
### [Lexicographic Permute Algorithm](Chapter4/LexicographicPermute.cpp)
### [Binary Reflected Gray Code](Chapter4/GrayCode.cpp)
### [Binary Search Algorithm](Chapter4/BinarySearch.cpp)
### [Lomuto Partitioning Algorithm](Chapter4/LomutoPartition.cpp)
### [Quick Select Algorithm](Chapter4/QuickSelect.cpp)
## Chapter5 Divide-and-Conquer
### [Merge Sort Algorithm](Chapter5/MergeSort.cpp)
### [Hoare Partition Algorithm](Chapter5/HoarePartition.cpp)
### [Quick Sort Algorithm](Chapter5/QuickSort.cpp)
### [Binary Tree Height](Chapter5/Height.cpp)
### [Karatsuba Algorithm](Chapter5/LargeInteger.cpp)
### [Strassen’s Algorithm](Chapter5/MatrixMultiplication.cpp)
### [Effient Closest Pair Algorithm](Chapter5/EffientClosestPair.cpp)
## Chapter6 Transform-and-Conquer
### [Gaussian Elimination](Chapter6/ForwardElimination.cpp)
### [AVL tree](Chapter6/AVL.cpp)
### [2-3 tree](Chapter6/2-3Tree.cpp)