- Notifications
You must be signed in to change notification settings - Fork0
Data Structures and Algorithms implementation in Go
License
aimof/Data-Structures-and-Algorithms
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Clean and simple implementation in Go
There are several data structures and algorithms implemented in this project. The list will be replenished with time.
- Circular Buffer
- Linked List
- Doubly Linked List
- Stack
- Queue
- Binary Tree
- Hash Table
- Linear Search
- Binary Search
- Jump Search
- Interpolation Search
- Exponential Search
- Ternary Search
- Selection Sort
- Insertion Sort
- Bubble Sort
- Comb Sort
- Cocktail Sort
- Gnome Sort
- Merge Sort
The library is not intended for direct use by importing. We strongly recommend copying the necessary implementations and adjusting to your case.
You can download the source usinggo get
command:
go get github.com/floyernick/Data-Structures-and-Algorithms
Don't forget about proverb:
A little copying is better than a little dependency.
We would be happy to receive your propositions of improvement! ReadContributing Guide for more details.
This project is licensed under theMIT License.
Mykyta Paliienko -GitHub profile
About
Data Structures and Algorithms implementation in Go
Resources
License
Code of conduct
Uh oh!
There was an error while loading.Please reload this page.
Stars
Watchers
Forks
Releases
Packages0
Languages
- Go100.0%