2014-06-24 15:08:31 +00:00
|
|
|
go-algorithms
|
2014-06-21 17:04:43 +00:00
|
|
|
=============
|
|
|
|
|
2016-09-03 23:00:26 +00:00
|
|
|
`go-algorithms` - implementation of different algorithms and data structures with `golang`.
|
2014-06-21 17:04:43 +00:00
|
|
|
|
2015-03-06 14:20:24 +00:00
|
|
|
Usage
|
2014-06-21 17:04:43 +00:00
|
|
|
-----
|
|
|
|
|
2014-06-24 15:09:13 +00:00
|
|
|
1. Clone `https://github.com/0xAX/go-algorithms.git` repo, it must be in your `$GOPATH`.
|
2014-06-21 17:04:43 +00:00
|
|
|
|
2014-06-24 15:09:13 +00:00
|
|
|
2. Execute `go build && go install` in `go-algorithms`
|
2014-06-21 17:04:43 +00:00
|
|
|
|
|
|
|
3. Execute `go build bubble_sort.go` and `./bubble_sort`
|
|
|
|
|
2016-09-03 23:00:26 +00:00
|
|
|
Algorithms
|
2014-06-22 15:00:00 +00:00
|
|
|
----------
|
|
|
|
|
|
|
|
#### Sorting
|
|
|
|
|
2017-02-20 18:35:45 +00:00
|
|
|
* [bubble sort](https://en.wikipedia.org/wiki/Bubble_sort)
|
|
|
|
* [selection sort](https://en.wikipedia.org/wiki/Selection_sort)
|
|
|
|
* [merge sort](https://en.wikipedia.org/wiki/Merge_sort)
|
|
|
|
* [cocktail sort](https://en.wikipedia.org/wiki/Cocktail_shaker_sort)
|
|
|
|
* [gnome sort](https://en.wikipedia.org/wiki/Gnome_sort)
|
|
|
|
* [quick sort](https://en.wikipedia.org/wiki/Quicksort)
|
|
|
|
* [comb sort](https://en.wikipedia.org/wiki/Comb_sort)
|
|
|
|
* [odd-even sort](https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort)
|
|
|
|
* [heap sort](https://en.wikipedia.org/wiki/Heapsort)
|
|
|
|
* [Shell sort](https://en.wikipedia.org/wiki/Shellsort)
|
|
|
|
* [counting sort](https://en.wikipedia.org/wiki/Counting_sort)
|
2020-09-30 16:37:11 +00:00
|
|
|
* [radix sort](https://en.wikipedia.org/wiki/Radix_sort)
|
2014-06-27 14:28:17 +00:00
|
|
|
|
2014-08-12 18:08:02 +00:00
|
|
|
#### Searching
|
|
|
|
|
2017-02-20 18:35:45 +00:00
|
|
|
* [binary search](https://en.wikipedia.org/wiki/Binary_search_algorithm)
|
2018-07-12 20:22:28 +00:00
|
|
|
* [linear search](https://en.wikipedia.org/wiki/Linear_search)
|
|
|
|
* [jump search](https://en.wikipedia.org/wiki/Jump_search)
|
2020-09-25 16:35:34 +00:00
|
|
|
* [depth first search](https://en.wikipedia.org/wiki/Depth-first_search)
|
2020-09-25 16:26:00 +00:00
|
|
|
* [breadth-first search](https://en.wikipedia.org/wiki/Breadth-first_search)
|
2014-08-12 18:08:02 +00:00
|
|
|
|
2014-08-09 17:24:50 +00:00
|
|
|
#### Collections
|
2014-06-27 14:28:17 +00:00
|
|
|
|
2017-02-20 18:35:45 +00:00
|
|
|
* [doubly linked list](https://en.wikipedia.org/wiki/Doubly_linked_list)
|
|
|
|
* [binary tree](https://en.wikipedia.org/wiki/Binary_search_tree)
|
|
|
|
* [stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))
|
|
|
|
* [queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))
|
2014-08-12 17:33:36 +00:00
|
|
|
|
2016-09-03 23:00:26 +00:00
|
|
|
#### Numerical
|
2014-08-12 17:33:36 +00:00
|
|
|
|
2017-02-20 18:35:45 +00:00
|
|
|
* [gcd](https://en.wikipedia.org/wiki/Greatest_common_divisor)
|
2018-07-12 20:54:09 +00:00
|
|
|
* [factorial](https://en.wikipedia.org/wiki/Factorial)
|
|
|
|
* [fibonacci](https://en.wikipedia.org/wiki/Fibonacci_number)
|
2018-07-12 20:22:28 +00:00
|
|
|
|
2015-03-06 14:20:24 +00:00
|
|
|
Contribution
|
2014-06-21 17:04:43 +00:00
|
|
|
------------
|
|
|
|
|
2014-06-24 15:09:13 +00:00
|
|
|
* Fork [go-algorithms](https://github.com/0xAX/go-algorithms);
|
2014-06-21 17:04:43 +00:00
|
|
|
* Make changes;
|
|
|
|
* Send pull request;
|
|
|
|
* Thank you.
|
|
|
|
|
2015-03-06 14:20:24 +00:00
|
|
|
Author
|
2014-06-21 17:04:43 +00:00
|
|
|
------
|
|
|
|
|
2015-03-06 14:20:24 +00:00
|
|
|
[@0xAX](https://twitter.com/0xAX)
|