# algorithm-journey

**Repository Path**: laomo_bear/algorithm-journey

## Basic Information

- **Project Name**: algorithm-journey
- **Description**: import from https://github.com/algorithmzuo/algorithm-journey
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: main
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 2
- **Created**: 2026-02-10
- **Last Updated**: 2026-02-10

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Algorithm Journey

## Project Introduction

This project is a systematic repository for learning and implementing algorithms, covering comprehensive content from fundamental data structures to advanced algorithms. Each chapter corresponds to a core algorithm topic, including theoretical explanations and practical code implementations, making it an ideal resource for learning algorithms and data structures.

## Project Structure

The project is organized into chapters by algorithm topics, with each `classXXX` representing an independent algorithm module:

| Chapter | Topic | Main Content |
|---------|-------|--------------|
| class001-class010 | Basic Algorithms | Sorting algorithms, searching, binary search |
| class011-class020 | Linked Lists and Queues | Linked list operations, queue and stack implementations |
| class021-class040 | Advanced Sorting and Searching | Merge sort, quicksort, heapsort, KMP |
| class041-class060 | Graph Theory Basics | Union-Find, topological sorting, shortest paths |
| class061-class080 | Tree Structures | Binary trees, tree DP, game theory |
| class081-class100 | Dynamic Programming | Knapsack problems, subsequences, state compression |
| class101-class120 | Strings and Trees | AC Automaton, Manacher, tree-based algorithms |
| class121-class130 | Advanced Topics | Tree diameter, flow, DP optimization |

## Core Features

- **Complete Algorithm Implementations**: Multiple implementation approaches provided for each algorithm to facilitate comparative learning
- **Detailed Comments**: Core code includes comprehensive Chinese comments
- **Test Cases**: Includes random data generation and correctness verification
- **Performance Optimization**: Offers implementations with varying time complexities

## Quick Start

```bash
# Clone the project
git clone https://gitee.com/laomo_bear/algorithm-journey.git

# Enter the project directory
cd algorithm-journey

# Compile and run (example: class001)
cd src/class001
javac LanguageConversion.java
java LanguageConversion
```

## Sample Code

```java
// Merge Sort Example
public static void mergeSort(int[] arr) {
    if (arr == null || arr.length < 2) return;
    help = new int[arr.length];
    sort(arr, 0, arr.length - 1);
}

private static void sort(int[] arr, int l, int r) {
    if (l == r) return;
    int m = (l + r) / 2;
    sort(arr, l, m);
    sort(arr, m + 1, r);
    merge(arr, l, m, r);
}
```

## Technology Stack

- **Language**: Java
- **Version**: JDK 8+
- **Dependencies**: No external dependencies

## License

This project is intended solely for learning purposes; do not use it for commercial purposes.