https://github.com/kakukosaku/dsa
Data Structures & Algorithms
https://github.com/kakukosaku/dsa
alogrithms data-structures
Last synced: 2 months ago
JSON representation
Data Structures & Algorithms
- Host: GitHub
- URL: https://github.com/kakukosaku/dsa
- Owner: kakukosaku
- Created: 2017-09-10T13:52:01.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2021-09-25T01:41:24.000Z (over 4 years ago)
- Last Synced: 2024-06-20T16:42:35.070Z (almost 2 years ago)
- Topics: alogrithms, data-structures
- Language: Go
- Homepage:
- Size: 4.48 MB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Overview
This Repository is about [Data Structure](#Data-Structure) and [Algorithm](#Algorithm), implementation maybe use C/Go/Python.
## Data Structure
### Topic
- 前言
- 基本概念
[Concept](theory.md#Basic-Concepts)
- 线性表
- 顺序表
[Concept](theory.md#Liner-Table)
[Implementation](list)
- 链表
[Concept](theory.md#Liner-Table)
[Implementation](linked_list)
- 栈
[Concept](theory.md#Stack-and-Queue)
[Implementation](stack)
- 队列
[Concept](theory.md#Stack-and-Queue)
[Implementation](queue)
- 矩阵
[Concept](theory.md#Matirx)
- 树
- 完全二叉树(满二叉树)
[Concept](theory.md#Binary-Tree)
[Implementation](tree)
- 线索二叉树
[Concept](theory.md#Thread-Tree)
[Implementation](tree)
- 赫夫曼树
[Concept](theory.md#Huffman-Tree)
[Implementation](tree)
- 二叉排序树/平衡二叉树(AVL)
[Concept](theory.md#Balanced-Binary-Search-Tree)
[Implementation](tree)
- 最小生成树
- 森林与树转化[Concept](theory.md#Tree-And-Forest)
- 多路查找树(B树)
- 图
- 存储结构
[Concept](theory.md#Graph)
- 遍历方式
[Concept](theory.md#Graph)
- 最小生成树
[Concept](theory.md#Graph)
- 最短路径
[Concept](theory.md#Graph)
- 拓扑排序
[Concept](theory.md#Graph)
- 关键路径
[Concept](theory.md#Graph)
## Algorithm
### Topic
- 查找
- 顺序查找与折半查找
- B树和B+树
- 散列表
- 排序算法
- 交换排序
- 冒泡排序 [C](sort/c_impl) [Go/Python](sort/bubble)
- 快速排序 [C](sort/c_impl) [Go/Python](sort/quick)
- 选择排序
- 简单选择 [C](sort/c_impl) [Go/Python](sort/select_impl)
- 堆排序 [C](sort/c_impl) [Go/Python](sort/heap_impl)
- 插入排序
- 直接插入选择 [C](sort/c_impl) [Go/Python](sort/insert)
- 希尔排序 [C](sort/c_impl) [Go/Python](sort/shell)
- 归并排序
- 归并选择 [C](sort/c_impl) [Go/Python](sort/merge)
### Problem