# Rust-algorithm

**Repository Path**: chen0adapter/Rust-algorithm

## Basic Information

- **Project Name**: Rust-algorithm
- **Description**: Rust 算法集
- **Primary Language**: Rust
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 36
- **Created**: 2021-01-20
- **Last Updated**: 2021-02-20

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# The Algorithms - Rust [![Gitter](https://img.shields.io/gitter/room/the-algorithms/rust.svg?style=flat-square)](https://gitter.im/the-algorithms/rust) [![Build Status](https://travis-ci.com/TheAlgorithms/Rust.svg?branch=master)](https://travis-ci.com/TheAlgorithms/Rust)

### All algorithms implemented in Rust (for educational purposes)

These are for demonstration purposes only.

## [Sort Algorithms](./src/sorting)

- [Bubble](./src/sorting/bubble_sort.rs)
- [Counting](./src/sorting/counting_sort.rs)
- [Heap](./src/sorting/heap_sort.rs)
- [Insertion](./src/sorting/insertion_sort.rs)
- [Merge](./src/sorting/merge_sort.rs)
- [Quick](./src/sorting/quick_sort.rs)
- [Radix](./src/sorting/radix_sort.rs)
- [Selection](./src/sorting/selection_sort.rs)
- [Shell](./src/sorting/shell_sort.rs)

## Graphs

- Dijkstra _(Not implemented yet)_
- Kruskal's Minimum Spanning Tree _(Not implemented yet)_
- Prim's Minimum Spanning Tree _(Not implemented yet)_
- BFS _(Not implemented yet)_
- DFS  _(Not implemented yet)_

## [Dynamic Programming](./src/general)

- 0-1 Knapsack _(Not implemented yet)_
- [Edit Distance](./src/dynamic_programming/edit_distance.rs)
- [Longest common subsequence](./src/dynamic_programming/longest_common_subsequence.rs)
- Longest increasing subsequence _(Not implemented yet)_
- [K-Means Clustering](./src/general/kmeans.rs)
- Coin Change _(Not implemented yet)_
- Rod cut _(Not implemented yet)_
- [Egg Dropping Puzzle](./src/dynamic_programming/egg_dropping.rs)

## Data Structures

- Queue _(Not implemented yet)_
- [Heap](./src/data_structures/heap.rs)
- [Linked List](./src/data_structures/linked_list.rs)
- Graph _(Not implemented yet)_
  - Directed _(Not implemented yet)_
  - Undirected _(Not implemented yet)_
- Trie _(Not implemented yet)_
- [Binary Search Tree](./src/data_structures/binary_search_tree.rs)
- [B-Tree](./src/data_structures/b_tree.rs)
- AVL Tree _(Not implemented yet)_

## Strings

- [Knuth Morris Pratt](./src/string/knuth_morris_pratt.rs)
- Rabin Carp _(Not implemented yet)_

## General

- [Convex Hull: Graham Scan](./src/general/convex_hull.rs)
- N-Queensp _(Not implemented yet)_
- Graph Coloringp _(Not implemented yet)_
- [Tower of Hanoi](./src/general/hanoi.rs)

## [Search Algorithms](./src/searching)

- [Linear](./src/searching/linear_search.rs)
- [Binary](./src/searching/binary_search.rs)

## [Ciphers](./src/ciphers)

- [Caesar](./src/ciphers/caesar.rs)
- [Vigenère](./src/ciphers/vigenere.rs)
- Transposition _(Not implemented yet)_

---
### Contributing

See [CONTRIBUTING.md](CONTRIBUTING.md)