- Sorting algorithms such as Quick Sort, Merge Sort, Insertion Sort, and Selection Sort.
- Search algorithms such as binary search and linear search.
- Graph algorithms, such as Depth-first search, Breadth-first search, etc.
- Dynamic programming algorithm, such as the knapsack problem and longest common subsequence.
- String matching algorithms such as KMP and Boyer-Moore algorithms.
- The divide and conquer algorithm includes methods such as merge sort and quick sort.
- Greedy algorithms such as minimum spanning tree and shortest path.
- Image processing algorithms such as image filtering and edge detection.
- Linear programming algorithms such as the simplex algorithm, integer programming, etc.
- Mathematical calculation algorithms such as multiplying large numbers and Gaussian elimination.
✖